Stable assignment with couples: Parameterized complexity and local search

We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents are allowed to form pairs and submit joint rankings over hospitals. We use the framework of parameterized complexity, considering the number of couples as a parameter. We also apply a local search approach, and examine the possibilities for giving FPT algorithms applicable in this context. Furthermore, we also investigate the matching problem containing couples that is the simplified version of the Hospitals/Residents with Couples problem modeling the case when no preferences are given.

[1]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[2]  F. Echenique,et al.  A Theory of Stability in Many-to-Many Matching Markets , 2004 .

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

[4]  Chung-Lun Li,et al.  Scheduling with processing set restrictions: A survey , 2008 .

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

[6]  Bettina Klaus,et al.  Stable matchings and preferences of couples , 2005, J. Econ. Theory.

[7]  Celia A. Glass,et al.  Parallel machine scheduling with job assignment restrictions , 2007 .

[8]  David F. Manlove,et al.  Stable Marriage with Ties and Unacceptable Partners , 1999 .

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

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

[11]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[13]  Stefan Szeider,et al.  The parameterized complexity of k-flip local search for SAT and MAX SAT , 2009, Discret. Optim..

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

[15]  Frances A. Rosamond,et al.  Parameterized Complexity News , 2009 .

[16]  D. Manlove,et al.  Keeping partners together: algorithmic results for the hospitals/residents problem with couples , 2010, J. Comb. Optim..

[17]  Eric McDermid,et al.  Matching with sizes (or scheduling with processing set restrictions) , 2014, Discret. Appl. Math..

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

[19]  Dániel Marx,et al.  A parameterized view on matroid optimization problems , 2009, Theor. Comput. Sci..

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

[21]  F. Vega-Redondo.  Complex Social Networks: Econometric Society Monographs , 2007 .

[22]  A. Roth,et al.  The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design , 1999, The American economic review.

[23]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[24]  Charles Blair,et al.  The Lattice Structure of the Set of Stable Matchings with Multiple Partners , 1988, Math. Oper. Res..

[25]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[26]  Dániel Marx,et al.  On the hardness of losing weight , 2012, TALG.

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

[28]  Michael R. Fellows,et al.  Local Search: Is Brute-Force Avoidable? , 2009, IJCAI.

[29]  Bhaskar Dutta,et al.  Stability of matchings when individuals have preferences over colleagues , 1997 .

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

[31]  Paul A. Robards,et al.  Applying Two-Sided Matching Processes to the United States Navy Enlisted Assignment Process , 2001 .

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

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

[34]  A. Roth.  A natural experiment in the organization of entry-level labor markets: regional markets for new physicians and surgeons in the United Kingdom. , 1991, The American economic review.

[35]  David Cantala.  Matching Markets: the Particular Case of Couples , 2004 .

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

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