A survey of the stable marriage problem and its variants

Proceedings - International Conference on Informatics Education and Research for Knowledge-Circulating Society, ICKS 2008

Volumn , Issue , 2008, Pages 131-136

  Iwama, Kazuo ^a   Miyazaki, Shuichi ^b  

^a KYOTO UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DECISION MAKING; TECHNOLOGY;

INFORMATICS EDUCATION; INTERNATIONAL CONFERENCES; OUTPUT MATCHING; PREFERENCE LISTS; STABLE MARRIAGE PROBLEMS;

GAME THEORY;

EID: 50149120106     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICKS.2008.7     Document Type: Conference Paper

References (61)

1. D. J. Abraham, R. W. Irving, T. Kavitha, K. Mehlhorn, "Popular matchings," SIAM J. Comput., Vol. 37, No. 4, pp. 1030-1045, 2007.
2. D. J. Abraham, P. Biró, D. F. Manlove, " "Almost stable" matchings in the roommates problem," Proc. WAOA 2005, LNCS 3879, pp. 1-14, 2005.
3. D. J. Abraham, R. W. Irving and D. F. Manlove, "The student-project allocation problem," Proc. ISAAC 2003, LNCS 2906, pp. 474-484, 2003.
4. E. M. Arkin, A. Efrat, J. S. B. Mitchell, and V. Polishchuk, "Geometric stable roommates," manuscript, 2007.
5. M. Baiou and M. Balinski, "Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)," Discrete Applied Mathematics, Vol. 101, pp. 1-12, 2000.
6. V. Bansal, A. Agrawal and V. S. Malhotra, "Stable marriages with multiple partners: efficient search for an optimal solution," Proc. ICALP 2003, LNCS 2719, pp. 527-542, 2003.
7. A. T. Benjamin, C. Converse and H. A. Krieger, "How do 1 marry thee? Let me count the ways," Discrete Applied Mathematics, Vol.59, pp. 285-292, 1995.
8. E. Boros, V. Gurvich, S. Jastar, and D. Krasner, "Stable matchings in three-sided systems with cyclic preferences," Discrete Mathematics, Vol. 289, pp. 1-10, 2004.
9. Canadian Resident Matching Service, http://www.carms.ca/
10. K. Cechlárová, "On the complexity of exchange-stable roommates," Discrete Applied Mathematics, Vol. 116, pp. 279-287, 2002.
11. D. Eilers, Irvine Compiler Corporation "[technical Report, ICC TR1999-2, 1999.
12. K. Eriksson, J. Sjöstrand, and P. Strimling, "Three-dimensional stable matching with cyclic preferences," Mathematical Social Sciences, Vol. 52, pp. 77-87, 2006.
13. D. Gale and L. S. Shapley, "College admissions and the stability of marriage," Amer. Math. Monthly, Vol.69, pp. 9-15, 1962.
14. D. Gale and M. Sotomayor, "Some remarks on the stable matching problem," Discrete Applied Mathematics, Vol.11, pp. 223-232, 1985.
15. D. Gusfield, "Three fast algorithms for four problems in stable marriage," SIAM J. Comput., Vol. 16, Issue 1, pp. 111-128, 1987.
16. D. Gusfield and R. W. Irving, "The Stable Marriage Problem: Structure and Algorithms," MIT Press, Boston, MA, 1989.
17. M. M. Halldórsson, R. W. Irving, K. Iwama, D. F. Manlove, S. Miyazaki, Y. Morita, and S. Scott, "Approximability Results for Stable Marriage Problems with Ties", Theoretical Computer Science, Vol. 306, pp. 431-447, 2003.
18. M. M. Halldórsson, K. Iwama, S. Miyazaki and H. Yanagisawa, "Randomized approximation of the stable marriage problem," Theoretical Computer Science, Vol. 325, No. 3, pp. 439-465, 2004.
19. M. M. Halldórsson, K. Iwama, S. Miyazaki, and H. Yanagisawa, "Improved approximation results of the stable marriage problem," ACM Transactions on Algorithms, Vol. 3, Issue 3, Article No. 30, 2007.
20. C. C. Haung, "Two's company, three's a crowd: stable family and threesome roommates problems," Proc. ESA 2007, LNCS 4698, pp. 558-569, 2007.
21. R. W. Irving, "An efficient algorithm for the "stable roommates" problem," J. Algorithms, Vol. 6, No. 4, pp. 577-595, 1985.
22. R. W. Irving, "Stable marriage and indifference," Discrete Applied Mathematics, Vol.48, pp. 261-272, 1994.
23. R. W. Irving, "Greedy matchings," University of Glasgow, Computing Science Department Research Report, TR-2003-136, 2003.
24. R. W. Irving, "Man-exchange stable marriage," University of Glasgow, Computing Science Department Research Report, TR-2004-177, 2004.
25. R. W. Irving, "The cycle roommates problem: a hard case of kidney exchange," Information Processing Letters, Vol. 103, Issue 1, pp. 1-4, 2007.
26. R. W. Irving, T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch, "Rank-maximal matchings," Proc. SODA 2004, pp. 68-75, 2004.
27. R. W. Irving and P. Leather, "The complexity of counting stable marriages," SIAM J. Comput., Vol.15, pp. 655-667, 1986.
28. R. W. Irving, P. Leather and D. Gusfield, "An efficient algorithm for the "optimal" stable marriage," Journal of the ACM, Vol. 34, pp. 532-543, 1987.
29. R. W. Irving and D. F. Manlove, "The stable roommates problem with ties," J. Algorithms, Vol. 43, No. 1, pp. 85-105, 2002.
30. R. W. Irving and D. F. Manlove, "An 8/5-approximation algorithm for a hard variant of stable marriage," Proc. COCOON 2007, LNCS 4598, pp. 548-558, 2007.
31. R. W. Irving, D. F. Manlove and G. O'Malley, "Stable marriage with ties and bounded length preference lists," Proc. the 2nd Algorithms and Complexity in Durham workshop, Texts in Algorithmes, College Publications, 2006.
32. R. W. Irving, D. F. Manlove, S. Scott, "The hospitals/residents problem with ties," Proc. SWAT 2000, LNCS 1851, pp. 259-271, 2000.
33. R. W. Irving, D. F. Manlove, S. Scott, "Strong stability in the hospitals/residents problem," Proc. STACS 2003, LNCS 2607, pp. 439-450, 2003.
34. K. Iwama, D. F. Manlove, S. Miyazaki, and Y. Morita, "Stable marriage with incomplete lists and ties," Proc. ICALP 99, LNCS 1644, pp. 443-452, 1999.
35. K. Iwama, S. Miyazaki, and K. Okamoto, "A (2-c log N/N)-approximation algorithm for the stable marriage problem," Proc. SWAT 2004, LNCS 3111, pp. 349-361, 2004.
36. K. Iwama, S. Miyazaki, and K. Okamoto, "Stable roommates problem with triple rooms," Proc. 10th KOREA-JAPAN Joint Workshop on Algorithms and Computation (WAAC2007), pp. 105-112, 2007.
37. K. Iwama, S. Miyazaki, N. Yamauchi, "A (2 - c-1/√N)- approximation algorithm for the stable marriage problem," Proc. ISAAC 2005, LNCS 3827, pp. 902-914, 2005.
38. K. Iwama, S. Miyazaki, N. Yamauchi, "A 1.875-approximation algorithm for the stable marriage problem," Proc. SODA 2007, pp. 288-297, 2007.
39. K. Iwama, S. Miyazaki, and H. Yanagisawa, "Approximation algorithms for the sex-equal stable marriage problem," Proc. WADS 2007, LNCS 4619, pp. 201-213, 2007.
40. Japan Residency Matching Program, http://www.jrmp.jp/
41. A. Kato, "Complexity of the sex-equal stable marriage problem," Japan Journal of Industrial and Applied Mathematics (JJIAM), Vol. 10, pp. 1-19, 1993.
42. T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch, "Strongly stable matchings in time O(nm) and extension to the H/R problem," Proc. STACS 2004, pp. 222-233, 2004.
43. S. Khuller, "Problems column," ACM Transactions on Algorithms, Vol. 3, Issue 3, Article No. 35, 2007.
44. D. E. Knuth, "Mariages Stables," Les Presses de l'Université Montréal, 1976. (Translated and corrected edition, "Stable Marriage and Its Relation to Other Combinatorial Problems," CRM Proceedings and Lecture Notes, Vol. 10, American mathematical Society, 1997.
45. E. Kujansuu, T. Lindberg, and E. Mäkinen, "The stable roommates problem and chess tournament pairings," Divulgaciones Matemáticas, Vol. 7, No. 1, pp. 19-28, 1999.
46. D. McVitie and L. B. Wilson, "The stable marriage problem," Communications of the ACM, Vol. 14, pp. 486-490, 1971.
47. V. S. Malhotra, "On the stability of multiple partner stable marriages with ties," Proc. ESA 2004, LNCS 3221, pp. 508-519, 2004.
48. D. F. Manlove, "Stable marriage with ties and unacceptable partners," University of Glasgow, Computing Science Department Research Report, TR-1999-29, 1999.
49. D. F. Manlove and C. T. S. Sng, "Popular matchings in the capacitated house allocation problem," Proc. ESA 2006, LNCS 4168, pp. 492-503, 2006.
50. D. F. Manlove, R. W. Irving, K. Iwama, S. Miyazaki, and Y. Morita, "Hard variants of stable marriage," Theoretical Computer Science, Vol. 276, Issue 1-2, pp. 261-279, 2002.
51. J. Mestre, "Weighted popular matchings," Proc. ICALP 2006, pp. 715-726, 2006.
52. National Resident Matching Program, http://www.nrmp.org/
53. C. Ng and D. S. Hirschberg, "Three-dimensional stable matching problems," SIAM Journal on Discrete Mathematics, Vol. 4, pp. 245-252, 1991.
54. A. E. Roth, "The evolution of the labor market for medical interns and residents: a case study in game theory", J. Political Economy, Vol. 92, No. 6, pp. 991-1016, 1984.
55. A. E. Roth, T. Sonmez, and M. U. Unver, "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, Vol. 125, No. 2, pp. 151-188, 2005.
56. A. E. Roth and M. Sotomayor, "Two-sided Matching: A Study in Game-theoretic Modeling and Analysis," Cambridge University Press, Cambridge, 1991.
57. E. Ronn,"NP-complete stable matching problems," J. Algorithms, Vol. 11, pp. 285-304, 1990.
58. Scottish PRHO Allocations, http://www.dcs.gla.ac.uk/~rwi/SPA.html
59. S. Scott, "A study of stable marriage problems with ties," Ph.D. Thesis, University of Glasgow, 2005.
60. A. Subramanian, "A new approach to stable matching problems," SIAM J. Comput., Vol. 23, No. 4, pp. 671-701, 1994.
61. E. G. Thurber, "Concerning the maximum number of stable matchings in the stable marriage problem," Discrete Mathematics, Vol.248, pp. 195-219, 2002.