Stabilization of Capacitated Matching Games
Matthew Gerstbrein (1), Laura Sanit\`a (2), Lucy Verberk (3) ((1), University of Waterloo, (2) Bocconi University of Milan, (3) Eindhoven, University of Technology)

TL;DR
This paper investigates the computational complexity of stabilizing capacitated matching games by blocking vertices, revealing polynomial-time solutions under certain restrictions and NP-hardness in the general case, and explores the differences from the unit-capacity scenario.
Contribution
It extends the understanding of the vertex-stabilizer problem from unit-capacity to arbitrary capacities, identifying complexity boundaries and the failure of equivalences present in the unit-capacity case.
Findings
Vertex-stabilizer problem with a restriction remains polynomial-time solvable.
Without the restriction, the problem becomes NP-hard and hard to approximate.
The equivalence between stability in different game models does not hold in the capacitated case.
Abstract
An edge-weighted, vertex-capacitated graph G is called stable if the value of a maximum-weight capacity-matching equals the value of a maximum-weight fractional capacity-matching. Stable graphs play a key role in characterizing the existence of stable solutions for popular combinatorial games that involve the structure of matchings in graphs, such as network bargaining games and cooperative matching games. The vertex-stabilizer problem asks to compute a minimum number of players to block (i.e., vertices of G to remove) in order to ensure stability for such games. The problem has been shown to be solvable in polynomial-time, for unit-capacity graphs. This stays true also if we impose the restriction that the set of players to block must not intersect with a given specified maximum matching of G. In this work, we investigate these algorithmic problems in the more general setting of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Advanced Graph Theory Research
