Stable matchings and stable partitions∗

DOI10.1080/00207169108803975zbMath0742.68047OpenAlexW2043109338WikidataQ126244539 ScholiaQ126244539MaRDI QIDQ3989849

Jimmy J. M. Tan

Publication date: 28 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108803975

zbMATH Keywords

stable roommates problemstable matchingstable partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items (6)

A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings ⋮ On random exchange-stable matchings ⋮ Balancing stability and efficiency in team formation as a generalized roommate problem ⋮ ``Almost stable matchings in the roommates problem with bounded preference lists ⋮ One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences ⋮ On random stable partitions

Cites Work

• Unnamed Item
• Some remarks on the stable matching problem
• An efficient algorithm for the “stable roommates” problem
• The Complexity of Counting Stable Marriages
• College Admissions and the Stability of Marriage

This page was built for publication: Stable matchings and stable partitions^∗