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

室友问题中基于轮廓的最优稳定匹配

Profile-based optimal stable matchings in the Roommates problem

Sofia Simola, David Manlove

摘要:

稳定室友问题可以允许多个不同的稳定匹配。我们有不同的标准来决定哪一个是最优的,但计算这些标准通常是NP困难的。我们发现,在不完整列表的室友问题的实例中,即使偏好列表的长度最多为3,找到慷慨或秩最大稳定匹配的问题也是NP-难的。我们发现,只是最大化的第一个选择的数量或最小化的最后选择的数量是NP-难的短偏好列表。我们证明了$R^{th}$的选择数,其中$R$是一个给定的SRI实例的最小遗憾,是2-近似的所有稳定匹配。此外,我们发现,找到一个稳定的匹配,最大化的第一个选择的数量的问题不承认一个常数时间近似算法,是W[1]-硬的第一个选择的数量。我们实现整数规划和约束规划公式的SRI的最优性准则。我们发现,约束规划优于整数规划和早期的答案集规划方法Erdam等。(2020)最优准则。在几乎稳定室友问题上,随机规划优于约束规划和回答集规划。

英文摘要:

The stable roommates problem can admit multiple different stable matchings. We have different criteria for deciding which one is optimal, but computing those is often NP-hard. We show that the problem of finding generous or rank-maximal stable matchings in an instance of the roommates problem with incomplete lists is NP-hard even when the preference lists are at most length 3. We show that just maximising the number of first choices or minimising the number of last choices is NP-hard with the short preference lists. We show that the number of $R^{th}$ choices, where $R$ is the minimum-regret of a given instance of SRI, is 2-approximable among all the stable matchings. Additionally, we show that the problem of finding a stable matching that maximises the number of first choices does not admit a constant time approximation algorithm and is W[1]-hard with respect to the number of first choices. We implement integer programming and constraint programming formulations for the optimality criteria of SRI. We find that constraint programming outperforms integer programming and an earlier answer set programming approach by Erdam et. al. (2020) for most optimality criteria. Integer programming outperforms constraint programming and answer set programming on the almost stable roommates problem.

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

↑