On Solution Concepts for Matching Games
From MaRDI portal
Publication:3569069
DOI10.1007/978-3-642-13562-0_12zbMath1284.91030OpenAlexW1526888049MaRDI QIDQ3569069
Péter Biró, Walter Kern, Daniël Paulusma
Publication date: 17 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_12
Cooperative games (91A12) Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Stabilization of capacitated matching games ⋮ Network bargaining: using approximate blocking sets to stabilize unstable instances ⋮ Graph Stabilization: A Survey
This page was built for publication: On Solution Concepts for Matching Games