Fleiner, T., Irving, R. W. and Manlove, D. F. (2008) An Algorithm for a Super-Stable Roommates Problem. In: Match-UP 2008: Matching Under Preferences - Algorithms and Complexity, Reykjavík, Iceland, 06 Jul 2008, pp. 126-132.
|
Text
150544.pdf - Accepted Version 321kB |
Publisher's URL: http://www.optimalmatching.com/workshop/matchup.pdf
Abstract
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 ordi- nary stable roommates problem.
Item Type: | Conference Proceedings |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Irving, Dr Robert and Manlove, Professor David and Fleiner, Dr Tamas |
Authors: | Fleiner, T., Irving, R. W., and Manlove, D. F. |
College/School: | College of Science and Engineering > School of Computing Science |
Copyright Holders: | Copyright © 2008 The Authors |
First Published: | First published in Match-UP 2008: Matching Under Preferences - Algorithms and Complexity: 126-132 |
Publisher Policy: | Reproduced with the permission of the Editor |
University Staff: Request a correction | Enlighten Editors: Update this record