On Stable Matchings and Flows
Budapest University of Technology and Economics, Department of Computer Science and Information Theory, Magyar tudósok körútja 2. H-1117, Budapest, Hungary and MTA-ELTE Egerváry Research Group, Eötvös Loránd University, Pázmány Péter sétány 1/C H-1117, Budapest, Hungary
Algorithms 2014, 7(1), 1-14; https://doi.org/10.3390/a7010001
Received: 1 August 2013 / Revised: 9 January 2014 / Accepted: 10 January 2014 / Published: 22 January 2014
(This article belongs to the Special Issue Special Issue on Matching under Preferences)
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
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
Share & Cite This Article
MDPI and ACS Style
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.
Find Other Styles
For more information on the journal statistics, click here. Multiple requests from the same IP address are counted as one view.