Stable matchings and stable partitions∗
From MaRDI portal
Publication:3989849
DOI10.1080/00207169108803975zbMath0742.68047WikidataQ126244539 ScholiaQ126244539MaRDI QIDQ3989849
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
Related Items
Balancing stability and efficiency in team formation as a generalized roommate problem, ``Almost stable matchings in the roommates problem with bounded preference lists, On random exchange-stable matchings, On random stable partitions, One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences, A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
Cites Work