Paper ID: 8633
An algorithm for a super-stable roommates problem
Proceedings of Match-UP: Matching Under Preferences - Algorithms and Complexity
Page Numbers : 126-132
URL: This publication is available at this URL.
In this paper we describe an efficient algorithm that decides if a stable matching exists for a generalized stable roommates problem, where, instead of linear preferences, agents have partial preference orders on potential partners. Furthermore, we may forbid certain partnerships, that is, we are looking for a matching such that none of the matched pairs is forbidden, and yet, no blocking pair (forbidden or not) exists. To solve the above problem, we generalize the first algorithm for the ordinary stable roommates problem.