Advertisement

An \(\frac{8}{5}\)-Approximation Algorithm for a Hard Variant of Stable Marriage

  • Robert W. Irving
  • David F. Manlove
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4598)

Abstract

When ties and incomplete preference lists are permitted in the Stable Marriage problem, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is known to be NP-hard, even under very severe restrictions on the number, size and position of ties. In this paper, we describe a polynomial-time \(\frac{8}{5}\)-approximation algorithm for a variant in which ties are on one side only and at the end of the preference lists. The particular variant is motivated by important applications in large scale centralized matching schemes.

Keywords

Approximation Algorithm Stable Match Performance Guarantee Maximum Cardinality Acceptable Pair 
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.
    (Canadian Resident Matching Service), http://www.carms.ca/jsp/main.jsp
  2. 2.
    Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9–15 (1962)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Applied Mathematics 11, 223–232 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)zbMATHGoogle Scholar
  5. 5.
    Halldórsson, M., Irving, R.W., Iwama, K., Manlove, D.F., Miyazaki, S., Morita, Y., Scott, S.: Approximability results for stable marriage problems with ties. Theoretical Computer Science 306(1-3), 431–447 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Halldórsson, M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation of the stable marriage problem. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 266–277. Springer, Heidelberg (2003)Google Scholar
  7. 7.
    Halldórsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Randomized approximation of the stable marriage problem. Theoretical Computer Science 325(3), 439–465 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Hopcroft, J.E., Karp, R.M.: A n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2, 225–231 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Irving, R.W., Manlove, D.F.: 8/5-approximation algorithms for hard variants of the stable marriage and hospitals/residents problems. Technical Report TR-2007-232, University of Glasgow, Department of Computing Science (February 2007)Google Scholar
  11. 11.
    Iwama, K., Miyazaki, S., Yamauchi, N.: \(A(2-c{1\over\sqrt{n}})\) approximation algorithm for the stable marriage problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 902–914. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Iwama, K., Miyazaki, S., Yamauchi, N.: A 1.875–approximation algorithm for the stable marriage problem. In: Proceedings of SODA 2007, pp. 288–297 (2007)Google Scholar
  13. 13.
    Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science 276(1-2), 261–279 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    (National Resident Matching Program), http://www.nrmp.org/about_nrmp/
  15. 15.
    Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. Journal of Political Economy 92(6), 991–1016 (1984)CrossRefGoogle Scholar
  16. 16.
    (Scottish Foundation Allocation Scheme), http://www.nes.scot.nhs.uk/sfas/

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Robert W. Irving
    • 1
  • David F. Manlove
    • 1
  1. 1.Department of Computing Science, University of Glasgow, Glasgow G12 8QQUK

Personalised recommendations