Efficient stabilization of cooperative matching games
From MaRDI portal
Publication:526875
DOI10.1016/j.tcs.2017.03.020zbMath1371.91135OpenAlexW2602878496MaRDI QIDQ526875
Naonori Kakimura, Naoyuki Kamiyama, Takehiro Ito, Yusuke Kobayashi, Yoshio Okamoto
Publication date: 15 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.03.020
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Matching models (91B68)
Related Items (9)
Stabilizing Network Bargaining Games by Blocking Players ⋮ Additive stabilizers for unstable graphs ⋮ Stabilization of capacitated matching games ⋮ Unnamed Item ⋮ Minimum cost stability in exchange networks ⋮ Graph Stabilization: A Survey ⋮ Stabilizing network bargaining games by blocking players ⋮ Stabilizing Weighted Graphs ⋮ Answers set programs for non-transferable utility games: expressiveness, complexity and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing solutions for matching games
- Finding small stabilizers for unstable graphs
- Network bargaining: using approximate blocking sets to stabilize unstable instances
- A maximum stable matching for the roommates problem
- Matching theory
- Fractional matchings and the Edmonds-Gallai theorem
- The node-deletion problem for hereditary properties is NP-complete
- Stabilization through taxation in \(n\)-person games
- The nucleon of cooperative games and an algorithm for matching games
- Stable outcomes of the roommate game with transferable utility
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An improved 2-agent kidney exchange mechanism
- Mix and match: a strategyproof mechanism for multi-hospital kidney exchange
- Additive approximation for edge-deletion problems
- Solutions for the stable roommates problem with payments
- The assignment game. I: The core
- The Stable Fixtures Problem with Payments
- Shapley meets Shapley
- The Bargaining Problem
- Stabilizing Network Bargaining Games by Blocking Players
- Assignment Problems and the Location of Economic Activities
- On the power of unique 2-prover 1-round games
- The Cooperative Game Theory Foundations of Network Bargaining Games
- The Cost of Stability in Coalitional Games
- An efficient algorithm for the “stable roommates” problem
- The complexity of some edge deletion problems
- Node-Deletion NP-Complete Problems
- Edge-Deletion Problems
- Properties of vertex packing and independence system polyhedra
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Integer Programming: Methods, Uses, Computations
- Paths, Trees, and Flowers
- Note on an Auction Procedure for a Matching Game in Polynomial Time
- Matching Games: The Least Core and the Nucleolus
- The Factorization of Linear Graphs
- College Admissions and the Stability of Marriage
This page was built for publication: Efficient stabilization of cooperative matching games