Parameterized algorithms for stable matching with ties and incomplete lists

Abstract We study the parameterized complexity of NP-hard optimization versions of Stable Matching and Stable Roommates in the presence of ties and incomplete lists. These problems model many real-life situations where solutions have to satisfy certain predefined criterion of suitability and compatibility. Specifically, our objective is to maximize/minimize the size of the stable matching. Our main theorems state that Stable Matching and Stable Roommates admit small kernels. Consequently, we also conclude that Stable Matching is fixed-parameter tractable ( FPT ) with respect to solution size, and that Stable Roommates is FPT with respect to a structural parameter. Finally, we analyze the special case where the input graph is planar.

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

[2]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

[3]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[4]  Patrick Prosser,et al.  An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists , 2002, ECAI.

[5]  K. Wagner.  Über eine Eigenschaft der ebenen Komplexe , 1937 .

[6]  Robin Thomas,et al.  Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

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

[8]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[9]  Dániel Marx,et al.  Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties , 2009, Algorithmica.

[10]  Joseph Douglas Horton,et al.  Minimum Edge Dominating Sets , 1993, SIAM J. Discret. Math..

[11]  Eric McDermid.  A 3/2-Approximation Algorithm for General Stable Marriage , 2009, ICALP.

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

[13]  Dominik Peters,et al.  Graphical Hedonic Games of Bounded Treewidth , 2016, AAAI.

[14]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[15]  Bart M. P. Jansen.  Polynomial Kernels for Hard Problems on Disk Graphs , 2010, SWAT.

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

[17]  Francesca Rossi,et al.  Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization , 2015, AAAI.

[18]  David Manlove,et al.  The structure of stable marriage with indifference , 2002, Discret. Appl. Math..

[19]  Eytan Ronn,et al.  NP-Complete Stable Matching Problems , 1990, J. Algorithms.

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