The complexity of matching games: a survey
From MaRDI portal
Publication:6488787
DOI10.1613/JAIR.1.14281MaRDI QIDQ6488787
Daniël Paulusma, Márton Benedek, Péter Biró, Matthew Johnson, Xin Ye
Publication date: 23 October 2023
Published in: The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)
Cooperative games (91A12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient stabilization of cooperative matching games
- 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
- Size versus stability in the marriage problem
- Cores of partitioning games
- The nucleon of cooperative games and an algorithm for matching games
- An algorithm for finding the nucleolus of assignment games
- Stable outcomes of the roommate game with transferable utility
- The stable fixtures problem with payments
- Fractional solutions for capacitated NTU-games, with applications to stable matchings
- Stabilizing network bargaining games by blocking players
- The general graph matching game: approximate core
- A general framework for computing the nucleolus via dynamic programming
- Finding and verifying the nucleolus of cooperative games
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
- Additive stabilizers for unstable graphs
- Solutions for the stable roommates problem with payments
- Complexity of constructing solutions in the core based on synergies among coalitions
- Another proof that assignment games have singleton cores only if multiple optimal matchings exist
- Cores of convex games
- The assignment game. I: The core
- The kernel and bargaining set for convex games
- Preference swaps for the stable matching problem
- Network Bargaining with General Capacities
- Computational Aspects of Cooperative Game Theory
- Shapley meets Shapley
- Assignment Problems and the Location of Economic Activities
- Stabilizing Weighted Graphs
- The Cooperative Game Theory Foundations of Network Bargaining Games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Vertex packings: Structural properties and algorithms
- Bounds on the Cost of Stabilizing a Cooperative Game
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Bribery and Control in Stable Marriage
- Integer Programming: Methods, Uses, Computations
- Maximum matching and a polyhedron with 0,1-vertices
- The Nucleolus of a Characteristic Function Game
- Matching Games: The Least Core and the Nucleolus
- A Short Proof of the Factor Theorem for Finite Graphs
- Approximation and Online Algorithms
- Computing the nucleolus of weighted cooperative matching games in polynomial time
This page was built for publication: The complexity of matching games: a survey
