A 3/2-Approximation Algorithm for General Stable Marriage

  • Eric McDermid
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5555)

Abstract

In an instance of the stable marriage problem with ties and incomplete preference lists, stable matchings can have different sizes. It is APX-hard to compute a maximum cardinality stable matching, but there have recently been proposed polynomial-time approximation algorithms, with constant performance guarantees for both the general version of this problem, and for several special cases. Our contribution is to describe a \(\frac{3}{2}\)-approximation algorithm for the general version of this problem, improving upon the recent \(\frac{5}{3}\)-approximation algorithm of Király. Interest in such algorithms arises because of the problem’s application to centralized matching schemes, the best known of which involve the assignment of graduating medical students to hospitals in various countries.

Keywords

Approximation Algorithm Stable Match Performance Guarantee Maximum Cardinality Preference List 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Biró, P.: Student Admissions in Hungary as Gale and Shapley Envisaged. University of Glasgow, Computing Science Department Research Report, TR-2008-291 (2008)Google Scholar
  2. 2.
    Gale, D., Shapley, L.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9–15 (1962)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Applied Mathematics 11, 223–232 (1985)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)MATHGoogle Scholar
  5. 5.
    Halldórsson, M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results for the stable marriage problem. ACM Trans. Algorithms 3(3), 30 (2007)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Halldórsson, M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Randomized approximation of the stable marriage problem. Theoretical Computer Science 325(3), 439–465 (2004)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM Journal on Computing 15(3), 655–667 (1986)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Irving, R.W., Manlove, D.F.: Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems. Journal of Combinatorial Optimization 16, 279–292 (2008)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Iwama, K., Miyazaki, S., Okamoto, K.: A \(\left(2-c\frac{\log n}{n}\right)\)-approximation algorithm for the stable marriage problem. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 349–361. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Iwama, K., Miyazaki, S., Yamauchi, N.: A \((2-c(1/\sqrt(N)))\)-Approximation Algorithm for the Stable Marriage Problem. Algorithmica 51(3), 342–356 (2008)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Iwama, K., Miyazaki, S., Yamauchi, N.: A 1.875–approximation algorithm for the stable marriage problem. In: 18th ACM/SIAM Symposium on Discrete Algorithms, pp. 288–297 (2007)Google Scholar
  12. 12.
    Király, Z.: Better and simpler approximation algorithms for the stable marriage problem. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol. 5193, pp. 623–634. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  13. 13.
    Knuth, D.E.: Mariages Stables. Les Presses de L’Université de Montréal (1976)Google Scholar
  14. 14.
    Lovász, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, vol. 29. North-Holland, Amsterdam (1986)MATHGoogle Scholar
  15. 15.
    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)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Canadian Resident Matching Service, http://www.carms.ca/jsp/main.jsp
  17. 17.
    National Resident Matching Program, http://www.nrmp.org/about_nrmp/how.html
  18. 18.
    Scottish Foundation Allocation Scheme, http://www.nes.scot.nhs.uk/sfas/
  19. 19.
    Yanagisawa, H.: Approximation algorithms for stable marriage problems, PhD thesis, Kyoto University, Graduate School of Informatics (2007)Google Scholar
  20. 20.
    Yanagisawa, H.: Personal communication (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Eric McDermid
    • 1
  1. 1.Department of Computing ScienceUniversity of GlasgowGlasgowUK

Personalised recommendations