Efficient algorithms for generalized Stable Marriage and Roommates problems

Theoretical Computer Science

Volumn 381, Issue 1-3, 2007, Pages 162-176

  Fleiner, Tamás ^a   Irving, Robert W ^b   Manlove, David F ^b  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Forbidden pair; Partial order; Stable Marriage problem; Stable Roommates problem; Super stable matching

Indexed keywords

COMPUTER SCIENCE; NUMBER THEORY; NUMERICAL METHODS; PROBLEM SOLVING;

FORBIDDEN PAIR; PARTIAL ORDER; STABLE MARRIAGE PROBLEMS; STABLE ROOMMATES PROBLEMS; SUPER-STABLE MATCHING;

ALGORITHMS;

EID: 34547224650     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.04.029     Document Type: Article

References (32)

1. Cechlárová K., and Fleiner T. On a generalization of the stable roommates problem. ACM Transactions on Algorithms 1 1 (2005) 143-156
2. Dias V.M.F., da Fonseca G.D., de Figueiredo C.M.H., and Szwarcfiter J.L. The stable marriage problem with restricted pairs. Theoretical Computer Science 306 1-3 (2003) 391-405
3. Even S., Itai A., and Shamir A. On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing 5 4 (1975) 691-703
4. T. Feder, Stable networks and product graphs, Memoirs of the American Mathematical Society 116 (555) (1995). Ph.D. Thesis, Stanford University, 1990
5. Feder T. A new fixed point approach for stable networks and stable marriages. Journal of Computer and System Sciences 45 (1992) 233-284
6. Feder T. Network flow and 2-satisfiability. Algorithmica 11 3 (1994) 291-319
7. Fishburn P. Preference structures and their numerical representations. Theoretical Computer Science 217 (1999) 359-383
8. Gale D., and Shapley L.S. College admissions and the stability of marriage. American Mathematical Monthly 69 (1962) 9-15
9. Gusfield D. Three fast algorithms for four problems in stable marriage. SIAM Journal on Computing 16 1 (1987) 111-128
10. Gusfield D. The structure of the stable roommate problem - Efficient representation and enumeration of all stable assignments. SIAM Journal on Computing 17 4 (1988) 742-769
11. Gusfield D., and Irving R.W. The Stable Marriage Problem: Structure and Algorithms (1989), MIT Press
12. Halldórsson M.M., Irving R.W., Iwama K., Manlove D.F., Miyazaki S., Morita Y., and Scott S. Approximability results for stable marriage problems with ties. Theoretical Computer Science 306 1-3 (2003) 431-447
13. Irving R.W. An efficient algorithm for the "stable roommates" problem. Journal of Algorithms 6 (1985) 577-595
14. R.W. Irving, On the stable room-mates problem, Technical Report CSC/86/R5, University of Glasgow, Department of Computing Science, 1986
15. Irving R.W. Stable marriage and indifference. Discrete Applied Mathematics 48 (1994) 261-272
16. Irving R.W., and Leather P. The complexity of counting stable marriages. SIAM Journal on Computing 15 3 (1986) 655-667
17. Irving R.W., and Manlove D.F. The stable roommates problem with ties. Journal of Algorithms 43 (2002) 85-105
18. Irving R.W., Manlove D.F., and Scott S. Strong stability in the Hospitals/Residents problem. Proceedings of STACS 2003: The 20th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science vol. 2607 (2003), Springer 439-450
19. Knuth D.E. Stable Marriage and its relation to other combinatorial problems. CRM Proceedings and Lecture Notes vol. 10 (1997), American Mathematical Society English translation of Mariages Stables, Les Presses de L'Université de Montréal, 1976
20. Kujansuu E., Lindberg T., and Mäkinen E. The Stable Roommates problem and chess tournament pairings. Divulgaciones Matemáticas 7 1 (1999) 19-28
21. D.F. Manlove, Stable marriage with ties and unacceptable partners, Technical Report TR-1999-29, University of Glasgow, Department of Computing Science, January 1999
22. Manlove D.F. The structure of stable marriage with indifference. Discrete Applied Mathematics 122 1-3 (2002) 167-181
23. Manlove D.F., Irving R.W., Iwama K., Miyazaki S., and Morita Y. Hard variants of stable marriage. Theoretical Computer Science 276 1-2 (2002) 261-279
24. Ng C., and Hirschberg D.S. Lower bounds for the Stable Marriage problem and its variants. SIAM Journal on Computing 19 (1990) 71-77
25. Ronn E. NP-complete stable matching problems. Journal of Algorithms 11 (1990) 285-304
26. Roth A.E. The evolution of the labor market for medical interns and residents: A case study in game theory. Journal of Political Economy 92 6 (1984) 991-1016
27. Roth A.E., Sönmez T., and Utku Ünver M. Pairwise kidney exchange. Journal of Economic Theory 125 (2005) 151-188
28. Roth A.E., and Sotomayor M.A.O. Two-sided matching: A study in game-theoretic modeling and analysis. Econometric Society Monographs vol. 18 (1990), Cambridge University Press
29. S. Scott, A study of Stable Marriage problems with ties, Ph.D. Thesis, University of Glasgow, Department of Computing Science, 2005
30. Spieker B. The set of Super-Stable Marriages forms a distributive lattice. Discrete Applied Mathematics 58 (1995) 79-84
31. Subramanian A. A new approach to stable matching problems. SIAM Journal on Computing 23 4 (1994) 671-700
32. Tan J.J.M. A necessary and sufficient condition for the existence of a complete stable matching. Journal of Algorithms 12 (1991) 154-178