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

稳定匹配:应对偏好变化

Stable Matching: Dealing with Changes in Preferences

University of California, Irvine(加州大学尔湾分校);Adobe Research(Adobe研究院);University of Maryland, College Park(马里兰大学帕克分校)

Rohith Reddy Gangam, Tung Mai, Nitya Raju, Vijay V. Vazirani

AI总结:

研究了在双侧稳定匹配设定中,针对偏好变化的鲁棒稳定匹配问题,探讨了鲁棒匹配的多项式时间求解、格结构以及多面体整性,发现临界阈值下这些属性可能失效。

摘要:

我们研究了在Gale和Shapley[GS62]提出的双侧稳定匹配设定中,对偏好变化具有鲁棒性的稳定匹配。给定两个实例A和B,同一组代理集上的匹配被称为鲁棒,如果它在两个实例下都稳定。尽管先前工作考虑了单个代理在A和B之间改变偏好的情况,我们允许两侧的多个代理更新其偏好,并询问三个稳定匹配的核心属性是否扩展到鲁棒稳定匹配:(i) 是否可以在多项式时间内找到鲁棒稳定匹配?(ii) 鲁棒稳定匹配的集合是否形成一个格?(iii) 鲁棒稳定匹配的分数多面体是否为整数?我们证明,只要另一侧的代理最多只有一个改变偏好,无论哪一侧的代理数量如何变化,这三个属性都成立。对于两侧均有两个或更多代理改变偏好的情况,我们构造了示例,表明格结构和多面体整性都会失败,将此设定称为临界阈值。我们还为一般情况提出了一个XP时间算法,这表明当改变偏好的代理数量为常数时,可以得到一个多项式时间算法。尽管这些结果确立了这些领域的可处理性,但关闭完全一般设定中的复杂性差距仍然是一个有趣的问题。

英文摘要:

We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley[GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable under both instances. While prior work has considered the case where a single agent changes preferences between $A$ and $B$, we allow multiple agents on both sides to update their preferences and ask whether three central properties of stable matchings extend to robust stable matchings: (i) Can a robust stable matching be found in polynomial time? (ii) Does the set of robust stable matchings form a lattice? (iii) Is the fractional robust stable matching polytope integral? We show that all three properties hold when any number of agents on one side change preferences, as long as at most one agent on the other side does. For the case where two or more agents on both sides change preferences, we construct examples showing that both the lattice structure and polyhedral integrality fail-identifying this setting as a sharp threshold. We also present an XP-time algorithm for the general case, which implies a polynomial-time algorithm when the number of agents with changing preferences is constant. While these results establish the tractability of these regimes, closing the complexity gap in the fully general setting remains an interesting open question.

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

↑