On Stable Matchings and Flows

Tamás Fleiner
2014 Algorithms  
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.
doi:10.3390/a7010001 fatcat:42gzqk3vybh6nonfzune5zivcq