The Stable Fixtures Problem with Payments

DOI10.1007/978-3-662-53174-7_4zbMath1422.91064OpenAlexW1932380090MaRDI QIDQ2827801

Daniël Paulusma, Péter Wojuteczky, Péter Biró, Walter Kern

Publication date: 21 October 2016

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/16185/1/16185.pdf

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Matching models (91B68)

Related Items

The stable fixtures problem with payments ⋮ Efficient stabilization of cooperative matching games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing solutions for matching games
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization.
• Stable outcomes of the roommate game with transferable utility
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• The stable fixtures problem -- a many-to-many extension of stable roommates
• Solutions for the stable roommates problem with payments
• The assignment game. I: The core
• On a generalization of the stable roommates problem
• Cooperative Games with Overlapping Coalitions
• 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
• 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.

This page was built for publication: The Stable Fixtures Problem with Payments