The stable fixtures problem with payments
From MaRDI portal
Publication:1651275
DOI10.1016/j.geb.2017.02.002zbMath1400.91014arXiv1508.06420OpenAlexW2586864289MaRDI QIDQ1651275
Walter Kern, Péter Wojuteczky, Péter Biró, Daniël Paulusma
Publication date: 12 July 2018
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.06420
Applications of graph theory (05C90) Cooperative games (91A12) Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Matching models (91B68)
Related Items
On the complexity of nucleolus computation for bipartite \(b\)-matching games, New and simple algorithms for stable flow problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing solutions for matching games
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- Axiomatization of the core of assignment games
- Finding small stabilizers for unstable graphs
- A note on the complexity of finding regular subgraphs
- Geometric algorithms and combinatorial optimization.
- Stable outcomes of the roommate game with transferable utility
- Assignment games with stable core
- Consistency and monotonicity in assignment problems
- The lattice structure of the set of stable outcomes of the multiple partners assignment game
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- Connecting the cooperative and competitive structures of the multiple-partners assignment game
- The stable fixtures problem -- a many-to-many extension of stable roommates
- Additive stabilizers for unstable graphs
- Solutions for the stable roommates problem with payments
- The assignment game. I: The core
- The Stable Fixtures Problem with Payments
- On a generalization of the stable roommates problem
- Shapley meets Shapley
- Cooperative Games with Overlapping Coalitions
- Stabilizing Network Bargaining Games by Blocking Players
- On a routing problem
- Assignment Problems and the Location of Economic Activities
- Odd Minimum Cut Sets and b-Matchings Revisited
- An efficient algorithm for the “stable roommates” problem
- Combinatorial Optimization with Rational Objective Functions
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Algorithmics of Matching Under Preferences
- Matching Games: The Least Core and the Nucleolus
- A Short Proof of the Factor Theorem for Finite Graphs
- College Admissions and the Stability of Marriage
- The new FIFA rules are hard: Complexity aspects of sports competitions.
