A Constraint Programming Approach to the Stable Marriage Problem
The Stable Marriage problem (SM) is an extensively-studied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a Constraint Satisfaction Problem. We prove that, in a precise sense, establishing arc consistency in J is equivalent to the action of the established Extended Gale/Shapley algorithm for SM on I. As a consequence of this, the man-optimal and woman-optimal stable matchings can be derived immediately. Furthermore we show that, in both encodings, all solutions of I may be enumerated in a failure-free manner. Our results indicate the applicability of Constraint Programming to the domain of stable matching problems in general, many of which are NP-hard.
Unable to display preview. Download preview PDF.
- 1.C. Bessière and J-C Régin. Arc consistency for general constraint networks: Preliminary results. In Proceedings of IJCAI’97, pages 398–404, 1997.Google Scholar
- 6.D. Gusfield and R. W. Irving. The Stable Marriage Problem: Structure and Algorithms. The MIT Press, 1989.Google Scholar
- 7.P. Jeavons, D. Cohen, and M. Gyssens. A unifying framework for tractable constraints. In Proceedings CP’95, volume LNCS 976, pages 276–291. Springer, 1995.Google Scholar
- 8.D.F. Manlove, R.W. Irving, K. Iwama, S. Miyazaki, and Y. Morita. Hard variants of stable marriage. To appear in Theoretical Computer Science.Google Scholar
- 13.A.E. Roth and M.A.O. Sotomayor. Two-sided matching: a study in game-theoretic modeling and analysis, volume 18 of Econometric Society Monographs. Cambridge University Press, 1990.Google Scholar
- 14.J.E. Vande Vate. Linear programming brings marital bliss. Operations Research Letters, 1989.Google Scholar