Abstract
We introduce and study the generalized stable allocation problem, an “ordinal” variant of the well-studied generalized assignment problem in which we seek a fractional assignment that is stable (in the same sense as in the classical stable marriage problem) with respect to a two-sided set of ranked preference lists. We develop an O(m logn) algorithm for solving this problem in a bipartite assignment graph with n nodes and m edges. When edge costs are present, we show that it is NP-hard to compute a stable assignment of minimum cost, a result that stands in stark contrast with most other stable matching problems (e.g., the stable marriage and stable allocation problems) for which we can efficiently optimize over the set of all stable assignments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baiou, M., Balinski, M.: Many-to-many matching: Stable polyandrous polygamy (or polygamous polyandry). Discrete Applied Mathematics 101, 1–12 (2000)
Baiou, M., Balinski, M.: Erratum: The stable allocation (or ordinal transportation) problem. Mathematics of Operations Research 27(4), 662–680 (2002)
Dean, B.C., Immorlica, N., Goemans, M.X.: Finite termination of “augmenting path” algorithms in the presence of irrational problem data. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 268–279. Springer, Heidelberg (2006)
Dean, B.C., Immorlica, N., Goemans, M.X.: The unsplittable stable marriage problem. In: Proceedings of the 4th IFIP International Conference on Theoretical Computer Science (2006)
Dean, B.C., Munshi, S.: Faster algorithms for stable allocation problems. In: Proceedings of the 1st MATCH-UP (Matching Under Preferences) Workshop, pp. 133–144 (2008)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69(1), 9–14 (1962)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completenes. W.H. Freeman, New York (1979)
Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the “optimal” stable marriage. Journal of the ACM 34(3), 532–543 (1987)
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, 991–1016 (1984)
Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences 26(3), 362–391 (1983)
Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM 32(3), 652–686 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dean, B.C., Swar, N. (2009). The Generalized Stable Allocation Problem. In: Das, S., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00202-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-00202-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00201-4
Online ISBN: 978-3-642-00202-1
eBook Packages: Computer ScienceComputer Science (R0)