Next Article in Journal
Bio-Inspired Meta-Heuristics for Emergency Transportation Problems
Next Article in Special Issue
Choice Function-Based Two-Sided Markets: Stability, Lattice Property, Path Independence and Algorithms
Previous Article in Journal
Sparse Signal Recovery from Fixed Low-Rank Subspace via Compressive Measurement
Previous Article in Special Issue
Overlays with Preferences: Distributed, Adaptive Approximation Algorithms for Matching with Preference Lists

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
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)
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. View Full-Text
Keywords: stable marriages; stable allocations; network flows stable marriages; stable allocations; network flows
Show Figures

Figure 1

MDPI and ACS Style

Fleiner, T. On Stable Matchings and Flows. Algorithms 2014, 7, 1-14.

AMA Style

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

Article Access Map by Country/Region

Only visits after 24 November 2015 are recorded.
Back to TopTop