Abstract
We present a specialised binary constraint for the stable marriage problem. This constraint acts between a pair of integer variables where the domains of those variables represent preferences. Our constraint enforces stability and disallows bigamy. For a stable marriage instance with n men and women we require n 2 of these constraints, and the complexity of enforcing arc-consistency is O(n 3). Although this is non-optimal, empirical evidence suggests that in practical terms our encoding significantly outperforms the optimal encoding given in [7] in both space and time.
The first author is supported by EPSRC. Software support was given by an ILOG SA’s academic grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ILOG JSolver, http://www.ilog.com/products/jsolver/
JChoco constraint programming system, http://choco.sourceforge.net/
Koalog Constraint Solver, http://www.koalog.com/
Aldershof, B., Carducci, O.: Refined inequalities for stable marriage. Constraints 4, 281–292 (1999)
Canadian Resident Matching Service. How the matching algorithm works. Web document, available at http://www.carms.ca/matching/algorith.htm
Gale, D., Shapley, L.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9–15 (1962)
Gent, I., Irving, R., Manlove, D., Prosser, P., Smith, B.: A constraint programming approach to the stable marriage problem. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 225–239. Springer, Heidelberg (2001)
Gent, I., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: ECAI 2002 (2002)
Green, M., Cohen, D.: Tractability by approximating constraint languages. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 392–406. Springer, Heidelberg (2003)
Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. The MIT Press, Cambridge (1989)
Irving, R.: Matching medical students to pairs of hospitals: a new variation on a well-known theme. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 381–392. Springer, Heidelberg (1998)
Irving, R., Manlove, D.: The stable roommates problem with ties. Journal of Algorithms 43, 85–105 (2002)
Kato, A.: Complexity of the sex-equal stable marriage problem. Japan Journal of Industrial and Applied Mathematics (JJIAM) 10, 1–19 (1993)
Lustig, I., Puget, J.: Program does not equal program: constraint programming and its relationship to mathematical programming. Interfaces 31, 29–53 (2001)
Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8, 99–118 (1977)
Manlove, D., Irving, R., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science 276, 261–279 (2002)
N. R. M. Program. About the NRMP. Web document available at http://www.nrmp.org/about_nrmp/how.html
Roth, A.: The evolution of the labor market for medical interns and residents: a case study in game theory. Journal of Political Economy 92(6), 991–1016 (1984)
van Hentenryck, P., Deville, Y., Teng, C.-M.: A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, 291–321 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Unsworth, C., Prosser, P. (2005). A Specialised Binary Constraint for the Stable Marriage Problem. In: Zucker, JD., Saitta, L. (eds) Abstraction, Reformulation and Approximation. SARA 2005. Lecture Notes in Computer Science(), vol 3607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527862_16
Download citation
DOI: https://doi.org/10.1007/11527862_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27872-6
Online ISBN: 978-3-540-31882-8
eBook Packages: Computer ScienceComputer Science (R0)