Bistable versions of the marriages and roommates problems
From MaRDI portal
Publication:1970204
DOI10.1006/jcss.1999.1657zbMath0946.90073OpenAlexW2107703193MaRDI QIDQ1970204
Publication date: 25 October 2000
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/01ff63ac8c6cf6081cd6468864a3489d1b32dcf7
Related Items (3)
Jointly stable matchings ⋮ Unnamed Item ⋮ A polynomial-time algorithm for the bistable roommates problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear programming brings marital bliss
- Characterization of stable matchings as extreme points of a polytope
- Three-Dimensional Stabl Matching Problems
- An efficient algorithm for the “stable roommates” problem
- The Complexity of Counting Stable Marriages
- A New Approach to Stable Matching Problems
- College Admissions and the Stability of Marriage
This page was built for publication: Bistable versions of the marriages and roommates problems