The Stable Roommates Problem with Choice Functions
From MaRDI portal
Publication:3503861
DOI10.1007/978-3-540-68891-4_27zbMath1143.91355MaRDI QIDQ3503861
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_27
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
90C27: Combinatorial optimization
91B68: Matching models
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new fixed point approach for stable networks and stable marriages
- On a lemma of Scarf.
- On the stable \(b\)-matching polytope.
- A generalization of the stable matching problem
- A lattice-theoretical fixpoint theorem and its applications
- On a generalization of the stable roommates problem
- A necessary and sufficient condition for the existence of a complete stable matching
- The Stable Roommates Problem with Choice Functions
- An efficient algorithm for the “stable roommates” problem
- Job Matching, Coalition Formation, and Gross Substitutes
- A New Approach to Stable Matching Problems
- Many-to-One Stable Matching: Geometry and Fairness
- The Core of an N Person Game
- A Fixed-Point Approach to Stable Matchings and Some Applications
- College Admissions and the Stability of Marriage
