The Strongly Stable Roommates Problem and Linear Programming
By: Naoyuki Kamiyama
Potential Business Impact:
Finds fair room assignments when people have preferences.
The stable roommates problem is a non-bipartite version of the stable matching problem in a bipartite graph. In this paper, we consider the stable roommates problem with ties. In particular, we focus on strong stability, which is one of the main stability concepts in the stable roommates problem with ties. We propose a new polynomial-time algorithm for the problem of checking the existence of a strongly stable matching in the stable roommates problem with ties. More concretely, we extend the linear programming approach of Abeledo and Blum to the stable roommates problem with strict preferences to our problem.
Similar Papers
A Linear Programming Approach to the Super-Stable Roommates Problem
CS and Game Theory
Finds fair roommate pairings, even with tricky choices.
Algorithms for Stable Roommate with Externalities
CS and Game Theory
Finds best roommate pairings for everyone.
Perspectives on Unsolvability in the Roommates Problem
CS and Game Theory
Finds ways to pair people when no perfect match exists.