The exchange-stable marriage problem

DOI10.1016/J.DAM.2005.06.003MaRDI QIDQ2576343zbMATH OpenOpenAlexFDO

Authors Katarina Cechlárová, David F. Manlove

Publication date 27 December 2005

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://eprints.gla.ac.uk/2145/1/esm%5B1%5D.pdf

zbMATH Keywords

coalition-exchange-stableman-exchange-stablematchingstable marriage problemstable roommates problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) (n)-person games, (n>2) (91A06) Matching models (91B68)

Recommendations

• On the complexity of exchange-stable roommates
• Stable matching problems with exchange restrictions
• On (coalitional) exchange-stable matching
• On random exchange-stable matchings
• Hard variants of stable marriage.

Cites work

• Algorithms and Computation
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An efficient algorithm for the “stable roommates” problem
• College Admissions and the Stability of Marriage
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 48303 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1305096 (Why is no real title available?)
• Incentive compatibility in a market with indivisible goods
• NP-complete stable matching problems
• On cores and indivisibility
• On the complexity of exchange-stable roommates
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Three-Dimensional Stabl Matching Problems
• Weak versus strong domination in a market with indivisible goods

Cited in

(24)

• Stable matching problems with exchange restrictions
• A mechanism implementing the stable rule in marriage problems
• The stable marriage problem with restricted pairs.
• On random exchange-stable matchings
• A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games
• On random stable partitions
• Exchange-stability in roommate problems
• Transfers and exchange-stability in two-sided matching problems
• On (coalitional) exchange-stable matching
• scientific article; zbMATH DE number 6672022 (Why is no real title available?)
• scientific article; zbMATH DE number 5572758 (Why is no real title available?)
• The algebra of stable marriages
• scientific article; zbMATH DE number 2047431 (Why is no real title available?)
• Stable matching games: manipulation via subgraph isomorphism
• A Size-Popularity Tradeoff in the Stable Marriage Problem
• Hardness results for stable exchange problems
• On the complexity of exchange-stable roommates
• Hardness results for stable exchange problems
• Topological distance games
• Stable matching games: manipulation via subgraph isomorphism
• Optimal seat arrangement: what are the hard and easy cases?
• On the convergence of swap dynamics to Pareto-optimal matchings
• Misrepresentation and stability in the marriage problem
• Hardness results on the man-exchange stable marriage problem with short preference lists

This page was built for publication: The exchange-stable marriage problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576343)