Advertisement

An Integer Programming Approach to the Hospitals/Residents Problem with Ties

  • Augustine KwanashieEmail author
  • David F. Manlove
Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

The classical Hospitals/Residents problem (HR) models the assignment of junior doctors to hospitals based on their preferences over one another. In an instance of this problem, a stable matching \(M\) is sought which ensures that no blocking pair can exist in which a resident \(r\) and hospital \(h\) can improve relative to \(M\) by becoming assigned to each other. Such a situation is undesirable as it could naturally lead to \(r\) and \(h\) forming a private arrangement outside of the matching. The original HR model assumes that preference lists are strictly ordered. However in practice, this may be an unreasonable assumption: an agent may find two or more agents equally acceptable, giving rise to ties in its preference list. We thus obtain the Hospitals/Residents problem with Ties (HRT). In such an instance, stable matchings may have different sizes and MAX HRT, the problem of finding a maximum cardinality stable matching, is NP-hard. In this paper we describe an Integer Programming (IP) model for MAX HRT. We also provide some details on the implementation of the model. Finally we present results obtained from an empirical evaluation of the IP model based on real-world and randomly generated problem instances.

References

  1. 1.
    National Resident Matching Program website. http://www.nrmp.org.
  2. 2.
    Irving, R. W. (1994). Stable marriage and indifference. Discrete Applied Mathematics, 48, 261–272.CrossRefGoogle Scholar
  3. 3.
    Gale, D., & Shapley, L. S. (1962). College admissions and the stability of marriage. American Mathematical Monthly, 69, 9–15.CrossRefGoogle Scholar
  4. 4.
    Manlove, D. F., Irving, R. W., Iwama, K., Miyazaki, S., & Morita, Y. (2002). Hard variants of stable marriage. Theoretical Computer Science, 276(1–2), 261–279.CrossRefGoogle Scholar
  5. 5.
    Király, Z. (2012). Linear time local approximation algorithm for maximum stable marriage. In Proceedings of MATCH-UP, Vol. 12, pp. 99–110.Google Scholar
  6. 6.
    McDermid, E. (2009). A 3/2 approximation algorithm for general stable marriage. In Proceedings of ICALP 09. LNCS (Vol. 5555, pp. 689–700). Berlin: Springer.Google Scholar
  7. 7.
    Kwanashie A., Manlove D. F. (2013) An integer programming approach to the hospitals/residents problem with ties. Technical Report 1308.4064, Computing Research Repository, Cornell University Library.Google Scholar
  8. 8.
    Podhradskỳ, A. (2011). Stable marriage problem algorithms. Masters thesis, Masaryk University, Faculty of Informatics.Google Scholar
  9. 9.
    Irving, R. W., & Manlove, D. F. (2009). Finding large stable matchings. ACM Journal of Experimental Algorithmics, 14, 2.Google Scholar
  10. 10.
    Király Z. (2008) Better and simpler approximation algorithms for the stable marriage problem. Algorithms-ESA 2008 (pp. 623–634). Berlin: Springer.Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.School of Computing ScienceUniversity of GlasgowGlasgowUK

Personalised recommendations