A polynomial-time algorithm for the bistable roommates problem

DOI10.1006/jcss.2001.1791zbMath1140.90480OpenAlexW2138100238MaRDI QIDQ1604203

Chung-Piaw Teo, Jay Sethuraman

Publication date: 4 July 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2d9a6e446bd19e906fefe31298f4bbb6f25a764f

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Permutations, words, matrices (05A05) Combinatorial optimization (90C27) Matching models (91B68)

Related Items (5)

Consistent enlargements of the core in roommate problems ⋮ Jointly stable matchings ⋮ Impossibilities for roommate problems ⋮ Smith and Rawls share a room: stability and medians ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear programming brings marital bliss
• Characterization of stable matchings as extreme points of a polytope
• Geometric algorithms and combinatorial optimization
• On a cutting plane heuristic for the stable roommates problem and its applications
• Bistable versions of the marriages and roommates problems
• The Geometry of Fractional Stable Matchings and Its Applications
• An efficient algorithm for the “stable roommates” problem
• Stable Matchings, Optimal Assignments, and Linear Programming
• College Admissions and the Stability of Marriage

This page was built for publication: A polynomial-time algorithm for the bistable roommates problem