The stable \(b\)-matching polytope revisited
From MaRDI portal
Publication:1801060
DOI10.1016/j.dam.2018.05.030zbMath1398.05164OpenAlexW2810072561MaRDI QIDQ1801060
Dimitrios Magos, Pavlos Eirinakis, Ioannis Mourtos
Publication date: 26 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.030
Related Items (3)
Review of the theory of stable matchings and contract systems ⋮ Stable allocations and partially ordered sets ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Many-to-many matching with max-min preferences
- Characterization of stable matchings as extreme points of a polytope
- A tale of two mechanisms: Student placement
- On the stable \(b\)-matching polytope.
- The stable admissions polytope
- Courtship and linear programming
- On the stable marriage polytope
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- Blockers and antiblockers of stable matchings
- Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
- On Stable Matchings and Flows
- The polynomial solvability of convex quadratic programming
- Stable Matchings, Optimal Assignments, and Linear Programming
- Polyhedral Aspects of Stable Marriage
- Many-to-One Stable Matching: Geometry and Fairness
- The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics
- The Transitive Reduction of a Directed Graph
- The Stable Allocation (or Ordinal Transportation) Problem
- A Fixed-Point Approach to Stable Matchings and Some Applications
- College Admissions and the Stability of Marriage
- A note on many-to-many matchings and stable allocations
This page was built for publication: The stable \(b\)-matching polytope revisited
