An algorithm for a super-stable roommates problem

被引：5
|
作者：
Fleiner, Tamas [1 ]
Irving, Robert W. [2 ]
Manlove, David F. [2 ]
机构：
[1] Budapest Univ Technol & Econ, Dept Comp Sci & Informat Theory, H-1117 Budapest, Hungary
[2] Univ Glasgow, Sch Comp Sci, Glasgow G12 8QQ, Lanark, Scotland
来源：
THEORETICAL COMPUTER SCIENCE | 2011年 / 412卷 / 50期
基金：
英国工程与自然科学研究理事会;
关键词：
Stable marriages; Stable roommates problem; Polynomial time algorithm; MARRIAGE;
D O I：
10.1016/j.tcs.2011.09.012
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：7059 / 7065
页数：7
相关论文
共 50 条
12345