On Stable Matchings and Flows
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.
KeywordsStable marriages stable allocations network flows
Unable to display preview. Download preview PDF.
- 3.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)Google Scholar
- 5.Fleiner, T.: On stable matchings and flows. Technical Report TR-2009-11, Egerváry Research Group, Budapest (2009), http://www.cs.elte.hu/egres
- 7.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 authorGoogle Scholar