Skip to main content
SpringerLink
Log in

Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints

  • Conference paper
  • First Online:
Algorithmic Game Theory (SAGT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9347))

Included in the following conference series:

Abstract

In this paper, we consider a matroid generalization of the hospitals/residents problem with ties and master lists. In this model, the capacity constraints for hospitals are generalized to matroid constraints. By generalizing the algorithms of O’Malley for the hospitals/residents problem with ties and master lists, we give polynomial-time algorithms for deciding whether there exist a super-stable matching and a strongly stable matching in our model, and finding such matchings if they exist.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9–15 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  2. Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math. 48(3), 261–272 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Manlove, D.F.: Stable marriage with ties and unacceptable partners. Technical report TR-1999-29, The University of Glasgow, Department of Computing Science (1999)

    Google Scholar 

  4. Irving, R.W., Manlove, D.F., Scott, S.: The hospitals/residents problem with ties. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 259–271. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Irving, R.W., Manlove, D.F., Scott, S.: Strong stability in the hospitals/residents problem. STACS 2003. LNCS, vol. 2607, pp. 439–450. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem. ACM Trans. Algorithms 3(2), 1–18 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fleiner, T.: A fixed-point approach to stable matchings and some applications. Math. Oper. Res. 28(1), 103–126 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Irving, R.W., Manlove, D.F., Scott, S.: The stable marriage problem with master preference lists. Discrete Appl. Math. 156(15), 2959–2977 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. O’Malley, G.: Algorithmic aspects of stable matching problems. Ph.D. thesis, The University of Glasgow (2007)

    Google Scholar 

  10. Abraham, D.J., Irving, R.W., Manlove, D.F.: Two algorithms for the student-project allocation problem. J. Discrete Algorithms 5(1), 73–90 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Oxley, J.G.: Matroid Theory, 2nd edn. Oxford University Press, New York (2011)

    Book  MATH  Google Scholar 

  12. Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. 15(4), 948–957 (1986)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics for Industry, Kyushu University, Fukuoka, Japan

    Naoyuki Kamiyama

  2. JST, PRESTO, Saitama, Japan

    Naoyuki Kamiyama

Authors
  1. Naoyuki Kamiyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naoyuki Kamiyama .

Editor information

Editors and Affiliations

  1. Max-Planck-Institut fĂĽr Informatik, SaarbrĂĽcken, Germany

    Martin Hoefer

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamiyama, N. (2015). Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints. In: Hoefer, M. (eds) Algorithmic Game Theory. SAGT 2015. Lecture Notes in Computer Science(), vol 9347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48433-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48433-3_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48432-6

  • Online ISBN: 978-3-662-48433-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation