arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.09583cs.GT
收藏

带拟阵与偏序的最大稳定匹配

Maximum Stable Matching with Matroids and Partial Orders

Gergely Csáji, Tamás Király, Yu Yokoi

AI总结:

本文研究拟阵核中的最大稳定匹配,针对区间序偏好给出简单的1.5近似算法,并证明二分情形LP整性隙上界及任意偏序下的因子2困难性。

摘要:

稳定婚姻问题(SM)由 Gale 和 Shapley 著名的延迟接受算法(GS)求解,并有许多自然推广。如果允许偏好中存在平局,那么寻找最大稳定匹配的问题就变为 NP 难,而已知最佳近似比为 1.5(McDermid 2009,Paluch 2011,Z. Király 2012),可通过在一个巧妙构造的修改实例上运行 GS 来实现。SM 的另一个优雅推广是 Fleiner(2001)提出的拟阵核问题,该问题可使用抽象的拟阵版本 GS 在多项式时间内求解。我们的主要结果是,当偏好以区间序(interval orders)——偏序的一个广泛子类,涵盖了带平局偏好之外的许多应用——给出时,为拟阵核问题提出一种简单的 1.5 近似算法。此外,对于二分匹配情形,我们证明算法输出还以 1.5 近似相应整数规划松弛的 LP 最优值,这表明区间序情形下的整性隙至多为 1.5。为与困难性结果对照,我们证明,如果偏好中允许任意偏序,那么即使在二分匹配情形下,假设 Unique Games Conjecture(唯一博弈猜想),该问题也难以获得优于因子 2 的近似,并且整性隙变为 2。

英文摘要:

The Stable Marriage problem (SM), solved by the famous deferred acceptance algorithm of Gale and Shapley (GS), has many natural generalizations. If we allow ties in preferences, then the problem of finding a maximum stable matching becomes NP-hard, and the best known approximation ratio is 1.5 (McDermid 2009, Paluch 2011, Z. Király 2012), achievable by running GS on a cleverly constructed modified instance. Another elegant generalization of SM is the matroid kernel problem introduced by Fleiner (2001), which is solvable in polynomial time using an abstract matroidal version of GS. Our main result is a simple 1.5-approximation algorithm for the matroid kernel problem when preferences are given as interval orders -- a broad subclass of partial orders that covers many applications beyond preferences with ties. In addition, for the bipartite matching case, we show that the output of our algorithm also 1.5-approximates the LP-optimum of the relaxation of the corresponding Integer Program, which shows that the integrality gap is at most 1.5 for the interval order case. To contrast this with hardness results, we show that if arbitrary partial orders are allowed in the preferences, then even in the bipartite matching case, the problem becomes hard to approximate within a factor better than 2 assuming the Unique Games Conjecture, and the integrality gap becomes 2.

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

↑