Abstract
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to any two-sided market. We consider a useful variation of the stable marriage problem, where the men and women express their preferences using a preference list with ties over a subset of the members of the other sex. Matchings are permitted only with people who appear in these preference lists. In this setting, we study the problem of finding a stable matching that marries as many people as possible. Stability is an envy-free notion: no man and woman who are not married to each other would both prefer each other to their partners or to being single. This problem is NP-hard. We tackle this problem using local search, exploiting properties of the problem to reduce the size of the neighborhood and to make local moves efficiently. Experimental results show that this approach is able to solve large problems, quickly returning stable matchings of large and often optimal size.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston (1989)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. The American Mathematical Monthly 69(1), 9–15 (1962)
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)
Gent, I.P., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: ECAI, pp. 141–145 (2002)
Gent, I.P., Prosser, P.: Sat encodings of the stable marriage problem with ties and incomplete lists. In: SAT 2002, pp. 133–140 (2002)
Yanagisawa: Approximation algorithms for stable marriage problems. PhD thesis, Kyoto University, Graduate School of Informatics (2007)
McDermid, E.: A 3/2-approximation algorithm for general stable marriage. In: Albers, S., et al. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 689–700. Springer, Heidelberg (2009)
Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 443–452. Springer, Heidelberg (1999)
Holger, H., Hoos, E.T.: Local search methods. In: Rossi, F., Beek, P.V., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Stutzle, T.G.: Local Search Algorithms for Combinatorial Problems - Analysis, Improvements, and New Applications. PhD thesis, Am Fachbereich Informatik der Technischen Universitat Darmstadt (1998)
Hoos, H.: On the run-time behaviour of stochastic local search algorithms for sat. In: Proc. AAAI 1999, pp. 661–666 (1999)
Roth, A.E., Vate, J.H.V.: Random paths to stability in two-sided matching. Econometrica 58(6), 1475–1480 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T. (2010). Local Search for Stable Marriage Problems with Ties and Incomplete Lists. In: Zhang, BT., Orgun, M.A. (eds) PRICAI 2010: Trends in Artificial Intelligence. PRICAI 2010. Lecture Notes in Computer Science(), vol 6230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15246-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-15246-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15245-0
Online ISBN: 978-3-642-15246-7
eBook Packages: Computer ScienceComputer Science (R0)