The Stable Roommates Problem with Globally Ranked Pairs
From MaRDI portal
Publication:3574308
DOI10.1080/15427951.2008.10129167zbMath1194.91133OpenAlexW2117557063MaRDI QIDQ3574308
David F. Manlove, Ariel Levavi, David J. Abraham, Gregg O'Malley
Publication date: 9 July 2010
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2008.10129167
Related Items (max. 100)
Stable matching with network externalities ⋮ Finding and Recognizing Popular Coalition Structures ⋮ Computing relaxations for the three-dimensional stable matching problem with cyclic preferences ⋮ Recognizing when a preference system is close to admitting a master list ⋮ Recognizing when a preference system is close to admitting a master list ⋮ Friend of my friend: network formation with two-hop benefit ⋮ Dynamics in matching and coalition formation games with structural constraints ⋮ Subjective homophily and the fixtures problem ⋮ When do stable roommate matchings exist? A review ⋮ Mathematical models for stable matching problems with ties and incomplete lists ⋮ Local Matching Dynamics in Social Networks ⋮ Improving solution times for stable matching problems through preprocessing ⋮ A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences ⋮ Paths to stable allocations
This page was built for publication: The Stable Roommates Problem with Globally Ranked Pairs
