"Almost stable" matchings in the roommates problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3879 LNCS, Issue , 2006, Pages 1-14

  Abraham, David J ^a   Biro, Péter ^b   Manlove, David F ^c  

^a Carnegie Mellon University   (United States)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^c UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES; SCHEDULING; STABILITY;

BLOCKING PAIRS; CLASSICAL STABLE ROOMMATES PROBLEM (SR); POLYNOMIAL-TIME ALGORITHM; STABLE MATCHING;

PROBLEM SOLVING;

EID: 33745595100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671411_1     Document Type: Conference Paper

References (17)

1. K. Cechlárová and T. Fleiner. On a generalization of the stable roommates problem. ACM Transactions on Algorithms, 1(1):143-156, 2005.
2. K. Eriksson and P. Strimling. How unstable are matchings from decentralized mate search? Preprint, 2005. Submitted for publication.
3. D. Gale and L.S. Shapley. College admissions and the stability of marriage. American Mathematical Monthly, 69:9-15, 1962.
4. D. Gusfield and R.W. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, 1989.
5. F. Harary. Maximum versus minimum invariants for graphs. J. Graph Theory, 7:275-284, 1983.
6. J.D. Horton and K. Kilakos. Minimum edge dominating sets. SIAM J. Discrete Mathematics, 6:375-387, 1993.
7. R.W. Irving. An efficient algorithm for the "stable roommates" problem. J. Algorithms, 6:577-595, 1985.
8. R.W. Irving and D.F. Manlove. The Stable Roommates Problem with Ties. J. Algorithms, 43:85-105, 2002.
9. D.E. Knuth. Manages Stables, Les Presses de L'Université de Montréal, 1976.
10. E. Kujansuu, T. Lindberg, and E. Mäkinen. The stable roommates problem and chess tournament pairings. Divulgaciones Matemáticas, 7(1):19-28, 1999.
11. M. Niederle and A.E. Roth. Market culture: How norms governing explording offers affect market performance. NBER working paper 10256, January 2004.
12. E.G. Pittel and R.W. Irving. An upper bound for the solvability probability of a random stable roommates instance. Rand. Struct. Algorithms, 5(3):465-486, 1994.
13. E. Ronn. NP-complete stable matching problems. J. Algorithms, 11:285-304, 1990.
14. A.E. Roth, T. Sönmez, and M. Utku Unver. Pairwise kidney exchange. To appear in Journal of Economic Theory.
15. A.E. Roth and M.A.O. Sotomayor. Two-sided matching: a study in game-theoretic modeling and analysis Cambridge University Press, 1990.
16. J.J.M. Tan. A necessary and sufficient condition for the existence of a complete stable matching. J. Algorithms, 12:154-178, 1991.
17. J.J.M. Tan. Stable matchings and stable partitions. International J. Computer Mathematics, 39:11-20, 1991.