arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1605.04609cs.DM
收藏

Stable Roommates problem with short lists(稳定室友问题)

The Stable Roommates problem with short lists

Ágnes Cseh, Robert W. Irving, David F. Manlove

摘要:

我们考虑具有不完全(但严格有序)偏好列表SRI的经典Stable Roommates问题的两个变体,其是度约束的,即,偏好列表的长度是有限的。第一个变体,EGAL d-SRI,涉及在SRI的可解实例中找到一个平均稳定匹配,偏好列表的长度最多为d。我们证明了即使d=3,这个问题也是NP-难的。在积极的一面,我们给出了一个(2d+3)/7-近似算法d={3,4,5},它改进了已知的界2的无界偏好列表的情况下。在SRI的第二种变体中,称为d-SRTI,偏好列表可以包括领带,并且长度最多为d。我们表明,问题的决定是否一个实例的d-SRTI承认一个稳定的匹配是NP-完全的,即使d=3。我们还考虑了这个问题的“最稳定”的版本,并证明了一个强大的不可逼近的d=3的情况下。然而,对于d=2,我们表明,后者的问题可以解决在多项式时间。

英文摘要:

We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists SRI that are degree constrained, i.e., preference lists are of bounded length. The first variant, EGAL d-SRI, involves finding an egalitarian stable matching in solvable instances of SRI with preference lists of length at most d. We show that this problem is NP-hard even if d=3. On the positive side we give a (2d+3)/7-approximation algorithm for d={3,4,5} which improves on the known bound of 2 for the unbounded preference list case. In the second variant of SRI, called d-SRTI, preference lists can include ties and are of length at most d. We show that the problem of deciding whether an instance of d-SRTI admits a stable matching is NP-complete even if d=3. We also consider the "most stable" version of this problem and prove a strong inapproximability bound for the d=3 case. However for d=2 we show that the latter problem can be solved in polynomial time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑