arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1412.0271cs.DMcs.DS
收藏

带限制边的稳定婚姻与室友问题:复杂性与可逼近性

Stable marriage and roommates problems with restricted edges: complexity and approximability

Ágnes Cseh, David F. Manlove

摘要:

在稳定婚姻和室友问题中,给出了一组代理人,其中每个代理人都有一个严格排序的偏好列表。匹配是相互接受的代理的不相交对的集合。如果任何两个代理相互喜欢对方,那么他们会阻止匹配,否则,匹配被称为稳定。在本文中,我们调查的复杂性,找到一个解决方案,满足额外的限制对代理。限制对可以是强制的,也可以是禁止的。一个稳定的解必须包含所有的强迫对,而它必须不包含任何禁止对。Dias等人给出了一个多项式时间算法来判定在存在限制边的情况下是否存在这样的解。如果答案是否定的,人们可能会寻找接近最优的解决方案。由于最优性在此上下文中意味着匹配是稳定的,并且满足限制对的所有约束,因此有两种方法可以通过允许解决方案来放松约束:(1)被某些对阻塞(尽可能少),或者(2)违反限制对的某些约束(同样尽可能少)。我们的主要定理证明,对于(二部)稳定婚姻问题,情况(1)导致NP-困难和不可逼近的结果,而情况(2)可以在多项式时间内解决。对于非二部稳定室友的情况,情况(2)产生NP-难问题。在NP-困难问题的情况下,我们还讨论了多项式可解的特殊情况下,所产生的限制的偏好列表的长度,或限制对的数量上界。

英文摘要:

In the stable marriage and roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually accepted agents. If any two agents mutually prefer each other to their partner, then they block the matching, otherwise, the matching is said to be stable. In this paper we investigate the complexity of finding a solution satisfying additional constraints on restricted pairs of agents. Restricted pairs can be either forced or forbidden. A stable solution must contain all of the forced pairs, while it must contain none of the forbidden pairs. Dias et al. gave a polynomial-time algorithm to decide whether such a solution exists in the presence of restricted edges. If the answer is no, one might look for a solution close to optimal. Since optimality in this context means that the matching is stable and satisfies all constraints on restricted pairs, there are two ways of relaxing the constraints by permitting a solution to: (1) be blocked by some pairs (as few as possible), or (2) violate some constraints on restricted pairs (again as few as possible). Our main theorems prove that for the (bipartite) stable marriage problem, case (1) leads to NP-hardness and inapproximability results, whilst case (2) can be solved in polynomial time. For the non-bipartite stable roommates instances, case (2) yields an NP-hard problem. In the case of NP-hard problems, we also discuss polynomially solvable special cases, arising from restrictions on the lengths of the preference lists, or upper bounds on the numbers of restricted pairs.

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

↑