Internet Mathematics

The Stable Roommates Problem with Globally Ranked Pairs

David J. Abraham, Ariel Levavi, David F. Manlove, and Gregg O'Malley

Full-text: Open access

Abstract

We introduce a restriction of the stable roommates problem in which room-mate pairs are ranked globally. In contrast to the unrestricted problem, weakly stable matchings are guaranteed to exist, and additionally, they can be found in polynomial time. However, it is still the case that strongly stable matchings may not exist, and so we consider the complexity of finding weakly stable matchings with various desirable properties. In particular, we present a polynomial-time algorithm to find a rank-maximal (weakly stable) matching. This is the first generalization of an algorithm due to R. W. Irving, D. Michail, K. Mehlhorn, K. Paluch, and K. Telikepalli. “Rank-Maximal Matchings.” to a nonbipartite setting. Also, we describe several hardness results in an even more restricted setting for each of the problems of finding weakly stable matchings that are of maximum size, are egalitarian, have minimum regret, and admit the minimum number of weakly blocking pairs.

Article information

Source
Internet Math., Volume 5, Number 4 (2008), 493-515.

Dates
First available in Project Euclid: 1 February 2010

Permanent link to this document
https://projecteuclid.org/euclid.im/1265033177

Mathematical Reviews number (MathSciNet)
MR2604974

Zentralblatt MATH identifier
1194.91133

Citation

Abraham, David J.; Levavi, Ariel; Manlove, David F.; O'Malley, Gregg. The Stable Roommates Problem with Globally Ranked Pairs. Internet Math. 5 (2008), no. 4, 493--515. https://projecteuclid.org/euclid.im/1265033177


Export citation