The Hospitals/Residents Problem with Ties
The hospitals/residents problem is an extensively-studied many-one stable matching problem. Here, we consider the hospitals/ residents problem where ties are allowed in the preference lists. In this extended setting, a number of natural definitions for a stable matching arise. We present the first linear-time algorithm for the problem under the strongest of these criteria, so-called superstability. Our new results have applications to large-scale matching schemes, such as the National Resident Matching Program in the US, and similar schemes elsewhere.
- 1.Canadian Resident Matching Service. How the matching algorithm works. Web document available at http://www.carms.ca/algorith.htm.
- 4.D. Gusfield and R.W. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, 1989.Google Scholar
- 7.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, volume 1644 of Lecture Notes in Computer Science, pages 443–452. Springer-Verlag, 1999.Google Scholar
- 8.D.E. Knuth. Stable Marriage and its Relation to Other Combinatorial Problems, volume 10 of CRM Proceedings and Lecture Notes. American Mathematical Society, 1997. English translation of Mariages Stables, Les Presses de L'Université de Montréal, 1976.Google Scholar
- 9.D.F. Manlove. Stable marriage with ties and unacceptable partners. Technical Report TR-1999-29, University of Glasgow, Department of Computing Science, January 1999.Google Scholar
- 10.D.F. Manlove, R.W. Irving, K. Iwama, S. Miyazaki, and Y. Morita. Hard variants of stable marriage. Technical Report TR-1999-43, University of Glasgow, Department of Computing Science, September 1999. Submitted for publication.Google Scholar
- 14.A.E. Roth and M.A.O. Sotomayor. Two-sided matching: a study in game-theoretic modeling and analysis, volume 18 of Econometric Society Monographs. Cambridge University Press, 1990.Google Scholar
- 15.S. Scott. Implementation of matching algorithms. Master’s thesis, University of Glasgow, Department of Computing Science, 1999.Google Scholar