Modeling Stable Matching Problems with Answer Set Programming

The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley [7]. Several variants and extensions to this problem have since been investigated to cover a wider set of applications. Each time a new variant is considered, however, a new algorithm needs to be developed and implemented. As an alternative, in this paper we propose an encoding of the SMP using Answer Set Programming (ASP). Our encoding can easily be extended and adapted to the needs of specific applications. As an illustration we show how stable matchings can be found when individuals may designate unacceptable partners and ties between preferences are allowed. Subsequently, we show how our ASP based encoding naturally allows us to select specific stable matchings which are optimal according to a given criterion. Each time, we can rely on generic and efficient off-the-shelf answer set solvers to find (optimal) stable matchings.

[1]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

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

[3]  Robert W. Irving.  The cycle roommates problem: a hard case of kidney exchange , 2007, Inf. Process. Lett..

[4]  V. S. Costa,et al.  Theory and Practice of Logic Programming , 2010 .

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

[6]  Tomi Janhunen,et al.  Representing Normal Programs with Clauses , 2004, ECAI.

[7]  Robert W. Irving.  Stable Marriage and Indifference , 1994, Discret. Appl. Math..

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

[9]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[10]  Alvin E. Roth,et al.  Pairwise Kidney Exchange , 2004, J. Econ. Theory.

[11]  David F. Manlove,et al.  Stable Marriage with Ties and Unacceptable Partners , 1999 .

[12]  Phan Minh Dung,et al.  An Argumentation-Theoretic Foundations for Logic Programming , 1995, J. Log. Program..

[13]  Victor W. Marek,et al.  A theory of nonmonotonic rule systems I , 2005, Annals of Mathematics and Artificial Intelligence.

[14]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

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

[16]  Robert W. Irving,et al.  An efficient algorithm for the “optimal” stable marriage , 1987, JACM.

[17]  Alex M. Andrew,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2004 .

[18]  Dan Gusfield,et al.  Three Fast Algorithms for Four Problems in Stable Marriage , 1987, SIAM J. Comput..

[19]  Eric McDermid,et al.  Sex-Equal Stable Matchings: Complexity and Exact Algorithms , 2012, Algorithmica.

[20]  Baochun Li,et al.  Egalitarian stable matching for VM migration in cloud computing , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[21]  Esra Erdem,et al.  Tight logic programs , 2003, Theory and Practice of Logic Programming.

[22]  K. Iwama,et al.  A Survey of the Stable Marriage Problem and Its Variants , 2008, International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008).