On Stable Matchings and Flows

  title={On Stable Matchings and Flows},
  author={Tam{\'a}s Fleiner},
We describe a flow model related to ordinary network flows the same way as stable matchings are related to maximum matchings in bipartite graphs. 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. For the sake of completeness, we prove the results we need on stable allocations as an application of Tarski’s fixed point theorem. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
0 Extracted Citations
10 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 10 references

On the allocation of residents to rural hospitals: A general property of two-sided matching markets

  • A. E. Roth
  • Econometrica 1986,
  • 1986
Highly Influential
2 Excerpts

On Stable Matchings and Flows. In Graph-Theoretic Concepts in Computer Science

  • T. Fleiner
  • 2010
1 Excerpt

Similar Papers

Loading similar papers…