The stable roommates problem with ties

Journal of Algorithms

Volumn 43, Issue 1, 2002, Pages 85-105

  Irving, Robert W ^a   Manlove, David F ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Approximation algorithm; Indifference; Linear time algorithm; NP completeness; Stable matching problem; Super stability; Weak stability

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY;

LINEAR-TIME ALGORITHM; STABLE MATCHING PROBLEM; SUPER-STABILITY;

PROBLEM SOLVING;

EID: 0036557486     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2002.1219     Document Type: Article

References (19)

1. T. Feder, N. Megiddo, and S. Plotkin, A sublinear parallel algorithm for stable matching, in Proceedings of SODA '94: The 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 632-637, Assoc. Comput. Mach.-Soc. for Industr. & Appl. Math., New York Philadelphia, 1994.
2. D. Gale and L. S. Shapley, College admissions and the stability of marriage, Amer. Math. Monthly 69 (1962), 9-15.
3. M. R. Garey and D. S. Johnson, "Computers and Intractability," Freeman, San Francisco, 1979.
4. D. Gusfield, The structure of the stable roommate problem - Efficient representation and enumeration of all stable assignments, SIAM J. Comput. 17, No. 4 (1988), 742-769.
5. D. Gusfield and R. W. Irving, "The Stable Marriage Problem: Structure and Algorithms," MIT Press, Cambridge, MA, 1989.
6. J. D. Horton and K. Kilakos, Minimum edge dominating sets, SIAM J. Discrete Math. 6 (1993), 375-387.
7. R. W. Irving, An efficient algorithm for the "stable roommates" problem, J. Algorithms 6 (1985), 577-595.
8. R. W. Irving, "On the Stable Room-Mates Problem," Technical Report CSC/86/R5, University of Glasgow, Department of Computing Science, 1986.
9. R. W. Irving, Stable marriage and indifference, Discrete Appl. Math. 48 (1994), 261-272.
10. R. W. Irving, D. F. Manlove, and S. Scott, The hospitals/residents problem with ties, in "Proceedings of SWAT 2000: The 7th Scandinavian Workshop on Algorithm Theory," Lecture Notes in Computer Science, Vol. 1851, pp. 259-271, Springer-Verlag, Berlin/New York, 2000.
11. K. Iwama, D. Manlove, S. Miyazaki, and Y. Morita, Stable marriage with incomplete lists and ties, in "Proceedings of ICALP '99: The 26th International Colloquium on Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 1644, pp. 443-452, Springer-Verlag, Berlin/New York, 1999.
12. D. E. Knuth, "Stable Marriage and Its Relation to Other Combinatorial Problems," CRM Proceedings and Lecture Notes, Vol. 10, Am. Math. Soc., Providence, 1997. (English translation of "Marriages Stables," Les Presses de L'Université de Montréal, 1976.)
13. D. F. Manlove, NP-completeness of stable marriage with partially ordered lists under strong stability, unpublished manuscript, 2000.
14. D. F. Manlove, R. W. Irving, K. Iwana, S. Miyazaki, and Y. Morita, Hard variants of stable marriage, in Theor. Comput. Sci. to appear, 2002.
15. E. Ronn, On the complexity of stable matchings with and without ties, Ph.D. thesis, Yale University, 1986.
16. E. Ronn, NP-complete stable matching problems, J. Algorithms 11 (1990), 285-304.
17. A. E. Roth, The evolution of the labor market for medical interns and residents: A case study in game theory, J. Political Econ. 92, No. 6 (1984), 991-1016.
18. J. J. M. Tan, A necessary and sufficient condition for the existence of a complete stable matching, J. Algorithms 12 (1991), 154-178.
19. M. Yannakakis and F. Gavril, Edge dominating sets in graphs, SIAM J. Appl. Math. 18, No. 1 (1980), 364-372.