A matroid approach to stable matchings with lower quotas
From MaRDI portal
(Redirected from Publication:5743384)
A matroid approach to stable matchings with lower quotas (scientific article; zbMATH DE number 7053265)
A matroid approach to stable matchings with lower quotas (scientific article; zbMATH DE number 7053265)
Recommendations
Cites work
- A Fixed-Point Approach to Stable Matchings and Some Applications
- Characterization of stable matchings as extreme points of a polytope
- Classified stable matching
- College Admissions and the Stability of Marriage
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- scientific article; zbMATH DE number 1757951 (Why is no real title available?)
- Linear programming brings marital bliss
- Stable and crossing structures
- The college admissions problem with lower and common quotas
- The Hospitals/Residents Problem with Quota Lower Bounds
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
Cited in
(7)- The hospitals/residents problem with lower quotas
- Strategyproof matching with regional minimum and maximum quotas
- A matroid approach to stable matchings with lower quotas
- A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
- Assignment mechanisms under distributional constraints
- Classified stable matching
- Classified rank-maximal matchings and popular matchings: algorithms and hardness
This page was built for publication: A matroid approach to stable matchings with lower quotas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743384)