Share  Bookmark

 Download from



[2] D.J. Abraham, K. Cechl´arov´a, D.F. Manlove, and K. Mehlhorn. Pareto optimality in house allocation problems. In Proceedings of ISAAC 2004: the 15th Annual International Symposium on Algorithms and Computation, volume 3341 of Lecture Notes in Computer Science, pages 315. SpringerVerlag, 2004.
[3] J. Alcalde. Exchanceproofness or divorceproofness? Stability in onesided matching markets. Economic Design, 1:275287, 1995.
[4] K. Cechl´arov´a. On the complexity of exchangestable roommates. Discrete Applied Mathematics, 116(3):279287, 2002.
[5] D. Gale and L.S. Shapley. College admissions and the stability of marriage. American Mathematical Monthly, 69:915, 1962.
[6] M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman, San Francisco, CA., 1979.
[7] D. Gusfield and R.W. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, 1989.
[8] J.E. Hopcroft and R.M. Karp. A n5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2:225231, 1973.
[9] A. Hylland and R. Zeckhauser. The efficient allocation of individuals to positions. Journal of Political Economy, 87(2):293314, 1979.
[10] R.W. Irving. An efficient algorithm for the “stable roommates” problem. Journal of Algorithms, 6:577595, 1985.
[11] R.W. Irving. Matching medical students to pairs of hospitals: a new variation on a wellknown theme. In Proceedings of ESA '98: the Sixth European Symposium on Algorithms, volume 1461 of Lecture Notes in Computer Science, pages 381392.