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

多层审批首选项的稳定匹配:审批可能比严格首选项更难

Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences

Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana

摘要:

我们研究稳定的匹配问题,代理有多层的喜好:有$\ell$层,每个代理的一个偏好关系组成。最近,Chen等人[EC '18]用严格的偏好研究了这些问题,建立了经典稳定性概念的四个多层适应。我们跟进他们的工作,通过分析的计算复杂性的稳定匹配问题的多层批准的偏好。我们认为11个稳定的概念来自三个完善的稳定性概念的稳定匹配与领带和陈等人提出的四个自适应。对于每个稳定的概念,我们发现,找到一个稳定的匹配的问题是多项式时间可解或NP-难。此外,我们还研究了层数和所需的“稳定度”对问题复杂性的影响。有些令人惊讶的是,我们发现,假设批准偏好而不是严格的偏好并没有大大简化情况(有时甚至使多项式时间可解问题NP难)。

英文摘要:

We study stable matching problems where agents have multilayer preferences: There are $\ell$ layers each consisting of one preference relation for each agent. Recently, Chen et al. [EC '18] studied such problems with strict preferences, establishing four multilayer adaptions of classical notions of stability. We follow up on their work by analyzing the computational complexity of stable matching problems with multilayer approval preferences. We consider eleven stability notions derived from three well-established stability notions for stable matchings with ties and the four adaptions proposed by Chen et al. For each stability notion, we show that the problem of finding a stable matching is either polynomial-time solvable or NP-hard. Furthermore, we examine the influence of the number of layers and the desired "degree of stability" on the problems' complexity. Somewhat surprisingly, we discover that assuming approval preferences instead of strict preferences does not considerably simplify the situation (and sometimes even makes polynomial-time solvable problems NP-hard).

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

↑