A unified approach to finding good stable matchings in the hospitals/residents setting
From MaRDI portal
Publication:930917
DOI10.1016/j.tcs.2008.02.014zbMath1211.90107OpenAlexW1987936822MaRDI QIDQ930917
Ichiro Suzuki, Eric J. McDermid, Christine T. Cheng
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.014
Discrete location and assignment (90B80) Theory of organizations, manpower planning in operations research (90B70) Matching models (91B68)
Related Items
Cycles to compute the full set of many-to-many stable matchings, Understanding the generalized median stable matchings, Rotations in the stable \(b\)-matching problem, Keeping partners together: Algorithmic results for the hospitals/residents problem with couples, On the set of many-to-one strongly stable fractional matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hardness results on the man-exchange stable marriage problem with short preference lists
- Some remarks on the stable matching problem
- Submodular functions and optimization
- A new fixed point approach for stable networks and stable marriages
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- The Geometry of Fractional Stable Matchings and Its Applications
- The Complexity of Counting Stable Marriages
- Three Fast Algorithms for Four Problems in Stable Marriage
- The College Admissions Problem Revisited
- Selected Applications of Minimum Cuts in Networks
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Many-to-One Stable Matching: Geometry and Fairness
- College Admissions and the Stability of Marriage