Modelling and Solving the Stable Marriage Problem Using Constraint Programming

We study the Stable Marriage problem (SM), which is a combinatorial problem that arises in many practical applications. We present two new models of an instance I of SM with n men and n women as an instance J of a Constraint Satisfaction Problem. We prove that establishing arc consistency in J yields the same structure as given by the established Extended Gale/Shapley algorithm for SM as applied to I. Consequently, a solution (stable matching) of I can be derived without search. Furthermore we show that, in both encodings, all stable matchings in I may be enumerated in a failure-free manner. Our first encoding is of O(n^3) complexity and is very natural, whilst our second model, of O(n^2) complexity (which is optimal), is a development of the Boolean encoding in [6], establishing a greater level of structure.

[1]  Eytan Ronn,et al.  NP-Complete Stable Matching Problems , 1990, J. Algorithms.

[2]  David Manlove,et al.  A Constraint Programming Approach to the Hospitals / Residents Problem , 2007, CPAIOR.

[3]  David Gale,et al.  Some remarks on the stable matching problem , 1985, Discret. Appl. Math..

[4]  Christian Bessiere,et al.  Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.

[5]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[6]  Patrick Prosser,et al.  An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists , 2002, ECAI.

[7]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[8]  David Manlove,et al.  Hard variants of stable marriage , 2002, Theor. Comput. Sci..

[9]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[10]  Akiko Kato,et al.  Complexity of the sex-equal stable marriage problem , 1993 .

[11]  Daniel S. Hirschberg,et al.  Lower Bounds for the Stable Marriage Problem and its Variants , 1990, SIAM J. Comput..

[12]  Brian Aldershof,et al.  Refined Inequalities for Stable Marriage , 1999, Constraints.

[13]  Patrick Prosser,et al.  A Specialised Binary Constraint for the Stable Marriage Problem , 2005, SARA.

[14]  A. Roth.  The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.

[15]  David A. Cohen,et al.  Tractability by Approximating Constraint Languages , 2003, CP.

[16]  J. V. Vate.  Linear programming brings marital bliss , 1989 .

[17]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[18]  David Manlove,et al.  A Constraint Programming Approach to the Stable Marriage Problem , 2001, CP.

[19]  Daniel S. Hirschberg,et al.  Three-Dimensional Stable Matching Problems , 1991, SIAM J. Discret. Math..

[20]  Jean-François Puget,et al.  Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming , 2001, Interfaces.

[21]  Patrick Prosser,et al.  SAT Encodings of the Stable Marriage Problem with Ties and Incomplete Lists , 2002 .