Stable assignment with couples: Parameterized complexity and local search

Discrete Optimization

Volumn 8, Issue 1, 2011, Pages 25-40

  Marx, Dániel ^a   Schlotter, Ildikó ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Couples; Local search; Parameterized complexity; Scheduling with job restrictions; Stable matching

Indexed keywords

CLASSICAL STABLE MARRIAGES; COUPLES; FPT ALGORITHMS; LOCAL SEARCH; MATCHING PROBLEMS; PARAMETERIZED COMPLEXITY; PROBLEM MODELING; STABLE ASSIGNMENT; STABLE MATCHING;

PARAMETERIZATION;

EID: 79952185068     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2010.07.004     Document Type: Article

References (31)

1. D. Gale, and L.S. Shapley College admissions and the stability of marriage Amer. Math. Monthly 69 1 1962 9 15
2. A.E. Roth The evolution of the labor market for medical interns and residents: a case study in game theory J. Political Econom. 92 1984 991 1016
3. A.E. Roth, and M. Sotomayor Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis Econometric Society Monographs vol. 18 1990 Cambridge University Press Cambridge, MA
4. P.A. Robards, Applying Two-Sided Matching Processes to the United States Navy Enlisted Assignment Process, Ph.D. Thesis, Naval Postgraduate School Monterey CA, 2001.
5. D.F. Manlove, Stable marriage with ties and unacceptable partners, Technical Report, University of Glasgow, Department of Computing Science, 1999.
6. D.F. Manlove, R.W. Irving, K. Iwama, S. Miyazaki, and Y. Morita Hard variants of stable marriage Theor. Comput. Sci. 276 12 2002 261 279 (Pubitemid 34295614)
7. R.W. Irving An efficient algorithm for the stable roommates problem J. Algorithms 6 4 1985 577 595
8. R.W. Irving, and D.F. Manlove The stable roommates problem with ties J. Algorithms 43 1 2002 85 105
9. A.E. Roth A natural experiment in the organization of entry-level labor markets: regional markets for new physicians and surgeons in the United Kingdom American Economic Review 81 3 1991 415 440
10. C. Blair The lattice structure of the set of stable matchings with multiple partners Math. Oper. Res. 13 4 1988 619 628
11. F. Echenique, and J. Oviedo A theory of stability in many-to-many matching markets Theor. Econ. 1 2 2006 233 273
12. A.E. Roth, and E. Peranson The redesign of the matching market for American physicians: some engineering aspects of economic design American Economic Review 89 4 1999 748 780
13. E. Ronn NP-complete stable matching problems J. Algorithms 11 2 1990 285 304
14. B. Klaus, and F. Klijn Stable matchings and preferences of couples J. Econom. Theory 121 1 2005 75 106 (Pubitemid 40272558)
15. D. Cantala Matching markets: the particular case of couples Economics Bulletin 3 45 2004 1 11
16. B. Dutta, and J. Mass Stability of matchings when individuals have preferences over colleagues J. Econom. Theory 75 2 1997 464 475 (Pubitemid 127341187)
17. E.J. McDermid, and D.F. Manlove Keeping partners together: algorithmic results for the hospitals/residents problem with couples J. Combin. Optim. 19 3 2010 279 303
18. R.G. Downey, and M.R. Fellows Parameterized Complexity Monographs in Computer Science 1999 Springer-Verlag New York
19. E.H.L. Aarts, J.K. Lenstra, Local Search in Combinatorial Optimization 2003 Princeton University Press Princeton, NJ Reprint of the 1997 original [Wiley, Chichester]
20. D. Marx Local search Parameterized Complexity News vol. 3 2008 7 8
21. S. Khuller, R. Bhatia, and R. Pless On local search and placement of meters in networks SODA'00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms 2000 Society for Industrial and Applied Mathematics Philadelphia, PA, USA 319 328 (Pubitemid 30549275)
22. A. Krokhin, and D. Marx On the hardness of losing weight ICALP 2008: 35rd International Colloquium on Automata, Languages and Programming Lecture Notes in Computer Science vol. 5125 2008 Springer Berlin 662 673
23. D. Marx Searching the k-change neighborhood for TSP is W[1]-hard Oper. Res. Lett. 36 1 2008 31 36 (Pubitemid 350251599)
24. D. Marx A parameterized view on matroid optimization problems Theor. Comput. Sci. 410 44 2009 4471 4479
25. R. Niedermeier Invitation to Fixed-Parameter Algorithms Oxford Lecture Series in Mathematics and its Applications vol. 31 2006 Oxford University Press Oxford
26. J. Flum, and M. Grohe Parameterized Complexity Theory Texts in Theoretical Computer Science. An EATCS Series 2006 Springer-Verlag New York
27. C.A. Glass, and H. Kellerer Parallel machine scheduling with job assignment restrictions Nav. Res. Logist. 54 3 2007 250 257 (Pubitemid 46542986)
28. P. Bir, E.J. McDermid, Matching with sizes (or scheduling with processing set restrictions), Technical Report TR-2010-307, University of Glasgow, Department of Computing Science, 2010.
29. J.Y.-T. Leung, and C.-L. Li Scheduling with processing set restrictions: a survey Int. J. Prod. Econ. 116 2008 251 262
30. D. Gale, and M. Sotomayor Some remarks on the stable matching problem Discrete Appl. Math. 11 3 1985 223 232 (Pubitemid 15529376)
31. N. Alon, R. Yuster, and U. Zwick Color-coding J. ACM 42 4 1995 844 856