Abstract
The stable roommates problem is that of matchingn people inton/2 disjoint pairs so that no two persons, who are not paired together, both prefer each other to their respective mates under the matching. Such a matching is called “a complete stable matching”. It is known that a complete stable matching may not exist. Irving proposed anO(n 2) algorithm that would find one complete stable matching if there is one, or would report that none exists. Since there may not exist any complete stable matching, it is natural to consider the problem of finding a maximum stable matching, i.e., a maximum number of disjoint pairs of persons such that these pairs are stable among themselves. In this paper, we present anO(n 2) algorithm, which is a modified version of Irving's algorithm, that finds a maximum stable matching.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Gale and L. Shapley,College admissions and the stability of marriage, Amer. Math. Monthly, 69 (1962), pp. 9–15.
D. Gusfield,The structure of the stable roommates problem: efficient representation and enumeration of all stable assignments, SIAM J. Comput, 17 (1988), pp. 742–769.
D. Gusfield and R. Irving,The Stable Marriage Problem: Structure and Algorithms, The MIT Press, Boston, MA, 1989.
R. Irving,An efficient algorithm for the stable roommates problem, J. Algorithms, 6 (1985) pp. 577–595.
R. Irving,On the stable room-mates problem, Res. Report CSC/86/R5, Department of Computing Science, University of Glasgow, July 1986.
D. E. Knuth,Mariages Stables, Les Presses de L'Université de Montréal, 1976. (In French.)
J. J. M. Tan,A necessary and sufficient condition for the existence of a complete stable matching, J. Algorithms, to appear.
Author information
Authors and Affiliations
Additional information
This research was supported by National Science Council of Republic of China under grant NSC 79-0408-E009-04.
Rights and permissions
About this article
Cite this article
Tan, J.J.M. A maximum stable matching for the roommates problem. BIT 30, 631–640 (1990). https://doi.org/10.1007/BF01933211
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01933211