On Stable Matchings and Flows
AbstractWe 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. View Full-Text
Share & Cite This Article
Fleiner, T. On Stable Matchings and Flows. Algorithms 2014, 7, 1-14.
Fleiner T. On Stable Matchings and Flows. Algorithms. 2014; 7(1):1-14.Chicago/Turabian Style
Fleiner, Tamás. 2014. "On Stable Matchings and Flows." Algorithms 7, no. 1: 1-14.