Abstract
The Gale-Shapley “propose/reject” algorithm is a well-known procedure for solving the classical stable marriage problem. In this paper we study this algorithm in the context of the many-to-many stable marriage problem, also known as the stable allocation or ordinal transportation problem. We present an integral variant of the Gale-Shapley algorithm that provides a direct analog, in the context of “ordinal” assignment problems, of a well-known bicriteria approximation algorithm of Shmoys and Tardos for scheduling on unrelated parallel machines with costs. If we are assigning, say, jobs to machines, our algorithm finds an unsplit (non-preemptive) stable assignment where every job is assigned at least as well as it could be in any fractional stable assignment, and where each machine is congested by at most the processing time of the largest job.
Please use the following format when citing this chapter: Dean, B.C., Goemans, M.X., Immorlica, N., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer), pp. 65–75.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Baiou and M. Balinski. Erratum: The stable allocation (or ordinal transportation) problem. Mathematics of Operations Research, 27(4):662–680, 2002.
Y. Dinitz, N. Garg, and M.X. Goemans. On the single-source unsplittable flow problem. Combinatorica, 19:17–41, 1999.
D. Gale and L.S. Shapley. College admissions and the stability of marriage. American Mathematical Monthly, 69(1):9–14, 1962.
D. Gusfield and R. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, 1989.
N. Immorlica and M. Mahdian. Marriage, honesty, and stability. In Proceedings of 16th ACM Symposium on Discrete Algorithms, pages 53–62, 2005.
B. Klaus and F. Klijn. Stable matchings and preferences of couples. Journal of Economic Theory, 121:75–106, 2005.
J.M. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, M.I.T., 1996.
D. E. Knuth. Stable marriage and its relation to other combinatorial problems. In CRM Proceedings and Lecture Notes, vol. 10, American Mathematical Society, Providence, RI. (English translation of Marriages Stables, Les Presses de L’Université de Montréal, 1976), 1997.
E. Ronn. Np-complete stable matching problems. Journal of Algorithms, 11:285–304, 1990.
A.E. Roth. The evolution of the labor market for medical interns and residents: a case study in game theory. Journal of Political Economy, 92:991–1016, 1984.
A.E. Roth. On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica, 54:425–427, 1986.
A.E. Roth. The national residency matching program as a labor market. Journal of the American Medical Association, 275(13):1054–1056, 1996.
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: 748–780, 1999.
A.E. Roth and M. Sotomayor. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press, 1990.
D.B. Shmoys and ÉE. Tardos. Scheduling unrelated machines with costs. In Proceedings of the 4th annual ACM-SIAM Symposium on Discrete algorithms (SODA), pages 448–454, 1993.
M. Skutella. Approximating the single source unsplittable min-cost flow problem. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 136–145, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Dean, B.C., Goemans, M.X., Immorlica, N. (2006). The Unsplittable Stable Marriage Problem. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)