Finding Robust Solutions to Stable Marriage

We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An $(a,b)$-supermatch is a stable matching in which if $a$ pairs break up it is possible to find another stable matching by changing the partners of those $a$ pairs and at most $b$ other pairs. In this context, we define the most robust stable matching as a $(1,b)$-supermatch where b is minimum. We show that checking whether a given stable matching is a $(1,b)$-supermatch can be done in polynomial time. Next, we use this procedure to design a constraint programming model, a local search approach, and a genetic algorithm to find the most robust stable matching. Our empirical evaluation on large instances show that local search outperforms the other approaches.

[1]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.

[2]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[3]  Matthew L. Ginsberg,et al.  Supermodels and Robustness , 1998, AAAI/IAAI.

[4]  R. Lathe.  Phd by thesis , 1988, Nature.

[5]  David Manlove,et al.  Algorithmics of Matching Under Preferences , 2013, Bull. EATCS.

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

[7]  Toby Walsh,et al.  Handbook of Constraint Programming (Foundations of Artificial Intelligence) , 2006 .

[8]  Patrick Siarry,et al.  A survey on optimization metaheuristics , 2013, Inf. Sci..

[9]  Gerald Jay Sussman,et al.  Building Robust Systems an essay , 2007 .

[10]  Laura Climent,et al.  Robustness and stability in dynamic constraint satisfaction problems , 2015, Constraints.

[11]  Emmanuel Hebrard,et al.  Robust solutions for constraint satisfaction and optimisation under uncertainty , 2007 .

[12]  L. Shapley,et al.  College Admissions and the Stability of Marriage , 1962 .

[13]  Robert W. Irving,et al.  The Complexity of Counting Stable Marriages , 1986, SIAM J. Comput..

[14]  Emmanuel Hebrard,et al.  Super Solutions in Constraint Programming , 2004, CPAIOR.

[15]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[16]  Barry O'Sullivan,et al.  Rotation-Based Formulation for Stable Matching , 2017, CP.

[17]  T. Stützle,et al.  Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.

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

[19]  Tomás Feder,et al.  A New Fixed Point Approach for Stable Networks and Stable Marriages , 1992, J. Comput. Syst. Sci..

[20]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[21]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[22]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[23]  Barry O'Sullivan,et al.  Robust Stable Marriage , 2017, AAAI.

[24]  David Manlove,et al.  Efficient algorithms for generalized Stable Marriage and Roommates problems , 2007, Theor. Comput. Sci..