Advertisement

The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models

  • Péter Biró
  • David F. Manlove
  • Iain McBride
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8504)

Abstract

The Hospitals / Residents problem with Couples (hrc) is a generalisation of the classical Hospitals / Residents problem (hr) that is important in practical applications because it models the case where couples submit joint preference lists over pairs of (typically geographically close) hospitals. In this paper we give a new NP-completeness result for the problem of deciding whether a stable matching exists, in highly restricted instances of hrc, and also an inapproximability bound for finding a matching with the minimum number of blocking pairs in equally restricted instances of hrc. Further, we present a full description of the first Integer Programming model for finding a maximum cardinality stable matching in an instance of hrc and we describe empirical results when this model applied to randomly generated instances of hrc.

Keywords

Stable Match Maximum Cardinality Integer Program Formulation Preference List Joint Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abraham, D.J., Biró, P., Manlove, D.F.: “Almost stable” matchings in the roommates problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 1–14. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Aldershof, B., Carducci, O.M.: Stable matching with couples. Discrete Appl. Math. 68, 203–207 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Ashlagi, I., Braverman, M., Hassidim, A.: Matching with couples revisited. Tech. Rep. arXiv: 1011.2121, Cornell University Library (2010)Google Scholar
  4. 4.
    Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. Tech. Rep. 49, ECCC (2003)Google Scholar
  5. 5.
    Biró, P.: Student admissions in Hungary as Gale and Shapley envisaged. Tech. Rep. TR-2008-291, University of Glasgow, Dept. of Computing Science (2008)Google Scholar
  6. 6.
    Biró, P., Irving, R.W., Schlotter, I.: Stable matching with couples: an empirical study. ACM J. Exp. Algorithmics 16, section 1, article 2 (2011)Google Scholar
  7. 7.
    Biró, P., Klijn, F.: Matching with couples: a multidisciplinary survey. International Game Theory Review 15(2), article number 1340008 (2013)Google Scholar
  8. 8.
    Biró, P., Manlove, D.F., McBride, I.: The hospitals / residents problem with couples: Complexity and integer programming models. Tech. Rep. arXiv: 1308.4534, Cornell University Library (2013)Google Scholar
  9. 9.
    Canadian Resident Matching Service, http://www.carms.ca
  10. 10.
    Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. Monthly 69, 9–15 (1962)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Appl. Math. 11, 223–232 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston (1989)zbMATHGoogle Scholar
  13. 13.
    Irving, R.W.: Matching medical students to pairs of hospitals: A new variation on a well-known theme. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 381–392. Springer, Heidelberg (1998)Google Scholar
  14. 14.
    Japan Resident Matching Program, http://www.jrmp.jp
  15. 15.
    Manlove, D.F.: Algorithmics of Matching Under Preferences. World Scientific, Singapore (2013)CrossRefzbMATHGoogle Scholar
  16. 16.
    McDermid, E.J., Manlove, D.F.: Keeping partners together: Algorithmic results for the hospitals / residents problem with couples. J. Comb. Optim. 19(3), 279–303 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Ng, C., Hirschberg, D.S.: Lower bounds for the stable marriage problem and its variants. SIAM J. Comput. 19, 71–77 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    National Resident Matching Program, http://www.nrmp.org
  19. 19.
    Ronn, E.: NP-complete stable matching problems. J. Algorithms 11, 285–304 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Roth, A.E.: The evolution of the labor market for medical interns and residents: A case study in game theory. J. Political Economy 92(6), 991–1016 (1984)CrossRefGoogle Scholar
  21. 21.
    Roth, A.E.: On the allocation of residents to rural hospitals: A general property of two-sided matching markets. Econometrica 54, 425–427 (1986)CrossRefMathSciNetGoogle Scholar
  22. 22.
    Roth, A.E., Peranson, E.: The effects of the change in the NRMP matching algorithm. J. Amer. Medical Assoc. 278(9), 729–732 (1997)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Péter Biró
    • 1
  • David F. Manlove
    • 2
  • Iain McBride
    • 2
  1. 1.Institute of Economics, Research Centre for Economic and Regional StudiesHungarian Academy of SciencesBudapestHungary
  2. 2.School of Computing ScienceUniversity of GlasgowGlasgowUK

Personalised recommendations