On Stable Matchings and Flows

DOI10.1007/978-3-642-16926-7_7zbMath1309.05089OpenAlexW2101018811MaRDI QIDQ3057612

Tamás Fleiner

Publication date: 16 November 2010

Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/20949/1/OnStableMatchings.pdf

zbMATH Keywords

network flowsstable marriagesstable allocations

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68) Flows in graphs (05C21)

Related Items (8)

A coloring property for stable allocations ⋮ Improved algorithmic results for unsplittable stable allocation problems ⋮ On the complexity of stable hypergraph matching, stable multicommodity flow and related problems ⋮ Stable multicommodity flows ⋮ Stable flows over time ⋮ On stable matchings and flows ⋮ On Stable Matchings and Flows ⋮ The stable \(b\)-matching polytope revisited

Cites Work

• A lattice-theoretical fixpoint theorem and its applications
• On a generalization of the stable roommates problem
• On Stable Matchings and Flows
• The Stable Allocation (or Ordinal Transportation) Problem
• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage
• Unnamed Item

This page was built for publication: On Stable Matchings and Flows