An algorithm for a super-stable roommates problem

Fleiner, T., Irving, R.W. and Manlove, D.F. (2011) An algorithm for a super-stable roommates problem. Theoretical Computer Science, 421(50), pp. 7059-7065. (doi:10.1016/j.tcs.2011.09.012)

[img]
Preview
Text
57323.pdf

187kB

Publisher's URL: http://dx.doi.org/10.1016/j.tcs.2011.09.012

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 ordinary stable roommates problem.

Item Type:Articles
Additional Information:NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science, [421, 50, (2011)] DOI: 10.1016/j.tcs.2011.09.012
Keywords:Stable marriages, stable roommates problem, polynomial time algorithm
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Irving, Dr Robert and Manlove, Dr David
Authors: Fleiner, T., Irving, R.W., and Manlove, D.F.
Subjects:Q Science > QA Mathematics
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Theoretical Computer Science
Publisher:Elsevier
ISSN:0304-3975
ISSN (Online):1879-2294
Published Online:21 September 2011
Copyright Holders:Copyright © 2011 Elsevier
First Published:First published in Theoretical Computer Science 421(50):7059-7065
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
436361MATCH-UP - matching under preferences - algorithms and complexityRobert IrvingEngineering & Physical Sciences Research Council (EPSRC)EP/E011993/1Computing Science