The Stable Roommates Problem with Ties

We study the variant of the well-known stable roommates problem in which participants are permitted to express ties in their preference lists. In this setting, more than one definition of stability is possible. Here we consider two of these stability criteria, so-called super-stability and weak stability. We present a linear?time algorithm for finding a super-stable matching if one exists, given a stable roommates instance with ties. This contrasts with the known NP-hardness of the analogous problem under weak stability. We also extend our algorithm to cope with preference lists that are incomplete and/or partially ordered. On the other hand, for a given stable roommates instance with ties and incomplete lists, we show that the weakly stable matchings may be of different sizes and the problem of finding a maximum cardinality weakly stable matching is NP-hard, though approximable within a factor of 2.

[1]  Nimrod Megiddo,et al.  A sublinear parallel algorithm for stable matching , 1994, SODA '94.

[2]  John Wade Ulrich.  A Characterization of Planar Oriented Graphs , 1970 .

[3]  A. Roth.  The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.

[4]  David Manlove,et al.  Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.

[5]  Eytan Ronn,et al.  On the complexity of stable matchings with and without ties , 1986 .

[6]  Robert W. Irving.  Stable Marriage and Indifference , 1994, Discret. Appl. Math..

[7]  Eytan Ronn,et al.  NP-Complete Stable Matching Problems , 1990, J. Algorithms.

[8]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[9]  Mihalis Yannakakis,et al.  Edge Dominating Sets in Graphs , 1980 .

[10]  Joseph Douglas Horton,et al.  Minimum Edge Dominating Sets , 1993, SIAM J. Discret. Math..

[11]  Guy P. Nason,et al.  CRM Proceedings and Lecture Notes , 1998 .

[12]  Jimmy J. M. Tan.  A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching , 1991, J. Algorithms.

[13]  David Manlove,et al.  Hard variants of stable marriage , 2002, Theor. Comput. Sci..

[14]  Dan Gusfield,et al.  The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments , 1988, SIAM J. Comput..

[15]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[16]  Robert W. Irving.  An Efficient Algorithm for the "Stable Roommates" Problem , 1985, J. Algorithms.

[17]  Donald E. Knuth,et al.  Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms , 1996 .

[18]  David Manlove,et al.  The Hospitals/Residents Problem with Ties , 2000, SWAT.