Abstract
We describe a flow model that generalizes ordinary network flows the same way as stable matchings generalize the bipartite matching problem. We prove that there always exists a stable flow and generalize the lattice structure of stable marriages to stable flows. Our main tool is a straightforward reduction of the stable flow problem to stable allocations.
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
Baïou, M., Balinski, M.: The stable allocation (or ordinal transportation) problem. Math. Oper. Res. 27(3), 485–503 (2002)
Cechlárová, K., Fleiner, T.: On a generalization of the stable roommates problem. ACM Trans. Algorithms 1(1), 143–156 (2005)
Dean, B.C., Munshi, S.: Faster algorithms for stable allocation problems. In: Proceedings of the MATCH-UP (Matching Under Preferences) Workshop at ICALP 2008, Reykjavik, pp. 133–144 (2008)
Fleiner, T.: A fixed point approach to stable matchings and some applications. Mathematics of Operations Research 28(1), 103–126 (2003)
Fleiner, T.: On stable matchings and flows. Technical Report TR-2009-11, Egerváry Research Group, Budapest (2009), http://www.cs.elte.hu/egres
Gale, D., Shapley, L.S.: College admissions and stability of marriage. Amer. Math. Monthly 69(1), 9–15 (1962)
Knuth, D.E.: Stable marriage and its relation to other combinatorial problems. American Mathematical Society, Providence (1997); An introduction to the mathematical analysis of algorithms, Translated from the French by Martin Goldstein and revised by the author
Ostrovsky, M.: Stability in supply chain networks. American Economic Review 98(3), 897–923 (2006)
Roth, A.E.: On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica 54(2), 425–427 (1986)
Roth, A.E., Oliveria Sotomayor, M.A.: Two-sided matching. Cambridge University Press, Cambridge (1990); A study in game-theoretic modeling and analysis, With a foreword by Robert Aumann
Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. of Math. 5, 285–310 (1955)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fleiner, T. (2010). On Stable Matchings and Flows. In: Thilikos, D.M. (eds) Graph Theoretic Concepts in Computer Science. WG 2010. Lecture Notes in Computer Science, vol 6410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16926-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-16926-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16925-0
Online ISBN: 978-3-642-16926-7
eBook Packages: Computer ScienceComputer Science (R0)