Finding Stable Matchings that are Robust to Errors in the Input

We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors. In the process, we also initiate work on a new structural question concerning the stable matching problem, namely finding relationships between the lattices of solutions of two "nearby" instances. Our main algorithmic result is the following: We identify a polynomially large class of errors, $D$, that can be introduced in a stable matching instance. Given an instance $A$ of stable matching, let $B$ be the random variable that represents the instance that results after introducing {\em one} error from $D$, chosen via a given discrete probability distribution. The problem is to find a stable matching for $A$ that maximizes the probability of being stable for $B$ as well. Via new structural properties of the type described in the question stated above, we give a combinatorial polynomial time algorithm for this problem. We also show that the set of robust stable matchings for instance $A$, under probability distribution $p$, forms a sublattice of the lattice of stable matchings for $A$. We give an efficient algorithm for finding a succinct representation for this set; this representation has the property that any member of the set can be efficiently retrieved from it.

[1]  Vijay V. Vazirani,et al.  A Generalization of Birkhoff's Theorem for Distributive Lattices, with Applications to Robust Stable Matchings , 2018, ArXiv.

[2]  Barry O'Sullivan,et al.  On the Complexity of Robust Stable Marriage , 2017, COCOA.

[3]  Barry O'Sullivan,et al.  Finding Robust Solutions to Stable Marriage , 2017, IJCAI.

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

[5]  Nicholas Mattei,et al.  Stable Matching with Uncertain Linear Preferences , 2016, Algorithmica.

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

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

[8]  Nicholas Mattei,et al.  Stable Matching with Uncertain Pairwise Preferences , 2017, AAMAS.

[9]  G. Birkhoff.  Rings of sets , 1937 .

[10]  Daniel J. Velleman.  American Mathematical Monthly , 2010 .

[11]  G. Calafiore,et al.  On Distributionally Robust Chance-Constrained Linear Programs , 2006 .

[12]  PRINCETON UNIVERSITY PRESS , 2005 .

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

[14]  V. Vazirani,et al.  Stable Matchings, Robust Solutions, and Distributive Lattices , 2018, 1804.05537.

[15]  Eduard Marinov.  The 2015 Nobel Prize in Economics , 2015 .

[16]  Robert W. Irving.  An Efficient Algorithm for the "Stable Roommates" Problem , 1985, J. Algorithms.

[17]  Donald E. Knuth,et al.  Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms , 1996 .