Stable Marriage and Roommates problems with restricted edges: Complexity and approximability

In the Stable Marriage and Roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually acceptable agents. If any two agents mutually prefer each other to their partner, then they block the matching, otherwise, the matching is said to be stable. We investigate the complexity of finding a solution satisfying additional constraints on restricted pairs of agents. Restricted pairs can be either forced or forbidden. A stable solution must contain all of the forced pairs, while it must contain none of the forbidden pairs.Dias et?al. (2003) gave a polynomial-time algorithm to decide whether such a solution exists in the presence of restricted edges. If the answer is no, one might look for a solution close to optimal. Since optimality in this context means that the matching is stable and satisfies all constraints on restricted pairs, there are two ways of relaxing the constraints by permitting a solution to: (1) be blocked by as few as possible pairs, or (2) violate as few as possible constraints n restricted pairs.Our main theorems prove that for the (bipartite) Stable Marriage problem, case (1) leads to NP -hardness and inapproximability results, whilst case (2) can be solved in polynomial time. For non-bipartite Stable Roommates instances, case (2) yields an NP -hard but (under some cardinality assumptions) 2 -approximable problem. In the case of NP -hard problems, we also discuss polynomially solvable special cases, arising from restrictions on the lengths of the preference lists, or upper bounds on the numbers of restricted pairs.

[1]  Chung-Piaw Teo,et al.  LP based approach to optimal stable matchings , 1997, SODA '97.

[2]  David Manlove,et al.  Socially Stable Matchings in the Hospitals/Residents Problem , 2013, WADS.

[3]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[4]  Jimmy J. M. Tan.  A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching , 1991, J. Algorithms.

[5]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[6]  Gregg O'Malley,et al.  Algorithmic aspects of stable matching problems , 2007 .

[7]  David Manlove,et al.  Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability , 2014, SAGT.

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

[9]  Tomás Feder.  A new fixed point approach for stable networks stable marriages , 1989, STOC '89.

[10]  Tomás Feder,et al.  Network flow and 2-satisfiability , 1994, Algorithmica.

[11]  Marek Karpinski,et al.  Approximation Hardness of Short Symmetric Instances of MAX-3SAT , 2003, Electron. Colloquium Comput. Complex..

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

[13]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[14]  David Manlove,et al.  The Stable Roommates Problem with Ties , 2002, J. Algorithms.

[15]  Péter Biró,et al.  A new solution concept for the roommate problem: Q-stable matchings , 2016, Math. Soc. Sci..

[16]  9. Deferred- Acceptance Algorithms: History, Theory, Practice , 2010 .

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

[18]  Laurent Viennot,et al.  Acyclic Preference Systems in P2P Networks , 2007, Euro-Par.

[19]  David Manlove,et al.  Stable Marriage with Ties and Bounded Length Preference Lists , 2006, ACiD.

[20]  A. Ageev,et al.  Approximation Algorithms for Scheduling Problems with Exact Delays , 2006, WAOA.

[21]  Uriel G. Rothblum,et al.  Characterization of stable matchings as extreme points of a polytope , 1992, Math. Program..

[22]  Eric McDermid,et al.  "Almost stable" matchings in the Roommates problem with bounded preference lists , 2012, Theor. Comput. Sci..

[23]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

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

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

[26]  Tamás Király,et al.  Total Dual Integrality of Rothblum's Description of the Stable-Marriage Polyhedron , 2008, Math. Oper. Res..

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

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

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

[30]  Chung-Piaw Teo,et al.  The Geometry of Fractional Stable Matchings and Its Applications , 1998, Math. Oper. Res..

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

[32]  Celina M. H. de Figueiredo,et al.  The stable marriage problem with restricted pairs , 2003, Theor. Comput. Sci..

[33]  Jimmy J. M. Tan.  A maximum stable matching for the roommates problem , 1990, BIT.

[34]  Shuichi Miyazaki,et al.  An improved approximation lower bound for finding almost stable maximum matchings , 2009, Inf. Process. Lett..

[35]  Donald E. Knuth.  Mariages stables et leurs relations avec d'autres problèmes combinatoires : introduction à l'analyse mathématique des algorithmes , 1976 .

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

[37]  Alvin E. Roth.  Deferred acceptance algorithms: history, theory, practice, and open questions , 2008, Int. J. Game Theory.

[38]  David Manlove,et al.  "Almost Stable" Matchings in the Roommates Problem , 2005, WAOA.

[39]  Samir Khuller,et al.  On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages , 1991, Theor. Comput. Sci..