Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties

We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matching of maximum size is NP-hard. We study the parameterized complexity of this problem, where the parameter can be the number of ties, the maximum or the overall length of ties. We also investigate the applicability of a local search algorithm for the problem. Finally, we examine the possibilities for giving an FPT algorithm or an FPT approximation algorithm for finding an egalitarian or a minimum regret matching.

[1]  David Manlove,et al.  Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.

[2]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[3]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

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

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

[6]  C. Pearce,et al.  An Efficient Algorithm for the , 1999 .

[7]  Samir Khuller,et al.  On local search and placement of meters in networks , 2000, SODA '00.

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

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

[10]  David Manlove,et al.  Approximability results for stable marriage problems with ties , 2003, Theor. Comput. Sci..

[11]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[12]  David Manlove,et al.  Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems , 2008, J. Comb. Optim..

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

[14]  Zoltán Király,et al.  Better and Simpler Approximation Algorithms for the Stable Marriage Problem , 2008, Algorithmica.

[15]  Dániel Marx,et al.  Stable assignment with couples: Parameterized complexity and local search , 2009, Discret. Optim..

[16]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[17]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

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

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

[20]  Dániel Marx,et al.  Searching the k-change neighborhood for TSP is W[1]-hard , 2008, Oper. Res. Lett..

[21]  Roberto Solis-Oba,et al.  Local Search , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[22]  W IrvingRobert,et al.  An efficient algorithm for the optimal stable marriage , 1987 .

[23]  Dániel Marx,et al.  Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..