On stable matchings and flows

Tamás Fleiner


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, generalize the lattice structure of stable marriages to stable flows and prove a flow extension of Pym's linking theorem.

Bibtex entry:

AUTHOR = {Fleiner, Tam{\'a}s},
TITLE = {On stable matchings and flows},
NOTE= {{\tt}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2009},
NUMBER = {TR-2009-11}

Last modification: 22.11.2022. Please email your comments to Tamás Király!