Cheating to Get Better Roommates in a Random Stable Matching

DOI10.1007/978-3-540-70918-3_39MaRDI QIDQ3590956zbMATH OpenOpenAlexFDO

Authors Chien-Chung Huang

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_39

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Recommendations

• Cheating by Men in the Gale-Shapley Stable Matching Algorithm
• Gale-Shapley stable marriage problem revisited: Strategic issues and applications. (Extended abstract)
• Cheating strategies for the Gale-Shapley algorithm with complete preference lists
• Gale-Shapley stable marriage problem revisited: strategic issues and applications
• Popular Matchings -- structure and cheating strategies

Cited in

(4)

• Strategic issues in college admissions with score-limits
• Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality?
• Gale-Shapley stable marriage problem revisited: Strategic issues and applications. (Extended abstract)
• Cheating by Men in the Gale-Shapley Stable Matching Algorithm

This page was built for publication: Cheating to Get Better Roommates in a Random Stable Matching

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