Stable matching problems with exchange restrictions

DOI10.1007/s10878-008-9153-1zbMath1159.91017OpenAlexW2053047805MaRDI QIDQ1016052

Robert W. Irving

Publication date: 4 May 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9153-1

zbMATH Keywords

matchingNP-complete problemsstable marriage

Mathematics Subject Classification ID

Matching models (91B68)

Related Items (3)

On random exchange-stable matchings ⋮ Integer programming methods for special college admissions problems ⋮ On (coalitional) exchange-stable matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hardness results on the man-exchange stable marriage problem with short preference lists
• Some remarks on the stable matching problem
• The exchange-stable marriage problem
• The Complexity of Counting Stable Marriages
• Three Fast Algorithms for Four Problems in Stable Marriage
• The complexity of satisfiability problems
• College Admissions and the Stability of Marriage
• On the complexity of exchange-stable roommates

This page was built for publication: Stable matching problems with exchange restrictions