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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9–15 (1962)
Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math. 48(3), 261–272 (1994)
Manlove, D.F.: Stable marriage with ties and unacceptable partners. Technical report TR-1999-29, The University of Glasgow, Department of Computing Science (1999)
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)
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)
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)
Fleiner, T.: A fixed-point approach to stable matchings and some applications. Math. Oper. Res. 28(1), 103–126 (2003)
Irving, R.W., Manlove, D.F., Scott, S.: The stable marriage problem with master preference lists. Discrete Appl. Math. 156(15), 2959–2977 (2008)
O’Malley, G.: Algorithmic aspects of stable matching problems. Ph.D. thesis, The University of Glasgow (2007)
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)
Oxley, J.G.: Matroid Theory, 2nd edn. Oxford University Press, New York (2011)
Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. 15(4), 948–957 (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)