Skip to main content
SpringerLink
Log in

Faster and Simpler Approximation of Stable Matchings

  • Conference paper
Approximation and Online Algorithms (WAOA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7164))

Included in the following conference series:

Abstract

We give a \(\frac{3}{2}\)-approximation algorithm for stable matchings that runs in O(m) time. The previously best known algorithm by McDermid has the same approximation ratio but runs in O(n 3/2 m) time, where n denotes the number of people and m is the total length of the preference lists in a given instance. Also the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Archer, A., Williamson, D.P.: Faster approximation algorithms for the minimum latency problem. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, pp. 88–96 (2003)

    Google Scholar 

  2. Abdulkadiroglu, A., Pathak, P.A., Roth, A.E.: Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match. American Economic Review 99(5), 1954–1978 (2009)

    Article  Google Scholar 

  3. Erdil, A., Haluk, E.: What’s the Matter with Tie-Breaking? Improving Efficiency in School Choice, Working Paper, Department of Economics, University of Oxford (2007)

    Google Scholar 

  4. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9–15 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  5. Halldorsson, M.M., Irving, R.W., Iwama, K., Manlove, D., Miyazaki, S., Morita, Y., Scott, S.: Approximability results for stable marriage problems with ties. Theor. Comput. Sci. 306(1-3), 431–447 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Halldorsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results for the stable marriage problem. ACM Transactions on Algorithms 3(3) (2007)

    Google Scholar 

  7. Irving, R.W., Manlove, D.: Finding large stable matchings. ACM Journal of Experimental Algorithmics 14 (2009)

    Google Scholar 

  8. Iwama, K., Miyazaki, S., Okamoto, K.: A \((2-c \frac{\log n}{n})\)-Approximation Algorithm for the Stable Marriage Problem. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 349–361. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Iwama, K., Miyazaki, S., Yamauchi, N.: A \((2-c\frac{1}{\sqrt(n)})\)-Approximation Algorithm for the Stable Marriage Problem. In: Deng, X., Du, D. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 902–914. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Iwama, K., Miyazaki, S., Yamauchi, N.: A 1.875 - approximation algorithm for the stable marriage problem. In: Bansal, N., Pruhs, K., Stein, C. (eds.) Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 288–297. SIAM, New Orleans (2007)

    Google Scholar 

  11. Kiraly, Z.: Better and Simpler Approximation Algorithms for the Stable Marriage Problem. Algorithmica 60(1), 3–20 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lovasz, L., Plummer, M.D.: Matching Theory. Ann. Discrete Math. 29 (1986)

    Google Scholar 

  13. Manlove, D., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1-2), 261–279 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. McDermid, E.: A 3/2-Approximation Algorithm for General Stable Marriage. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 689–700. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Mehlhorn, K.: A Faster Approximation Algorithm for the Steiner Problem in Graphs. Inf. Process. Lett. 27(3), 125–128 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  16. Yanagisawa, H.: Approximation algorithms for stable marriage problems, PhD thesis, Kyoto University, Graduate School of Informatics (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Wrocław University, Poland

    Katarzyna Paluch

Authors
  1. Katarzyna Paluch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, ON, Canada

    Roberto Solis-Oba

  2. Dipartimento di Informatica "Renato M. Capocelli", Università di Salerno, Via Ponte Don Melillo, 84081, Fisciano, SA, Italy

    Giuseppe Persiano

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paluch, K. (2012). Faster and Simpler Approximation of Stable Matchings. In: Solis-Oba, R., Persiano, G. (eds) Approximation and Online Algorithms. WAOA 2011. Lecture Notes in Computer Science, vol 7164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29116-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29116-6_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29115-9

  • Online ISBN: 978-3-642-29116-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation