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

寻找具有指派约束的所有稳定匹配

Finding all stable matchings with assignment constraints

Gregory Gutin, Philip R. Neary, Anders Yeo

AI总结:

针对带强制包含或排除配对的指派约束稳定匹配问题,提出基于反复删除无吸引力备选项的算法,可检验可行性并枚举全部满足条件的稳定匹配。

摘要:

本文考虑受指派约束的稳定匹配。这些匹配要求包含某些被指派的配对,坚持不包含其他一些被指派的配对,并且重要的是,它们是稳定的。我们的主要贡献是一种基于反复删除无吸引力备选项的算法,用于确定指派约束是否与稳定性相容。每当存在满足指派约束的稳定匹配时,我们的算法就会输出所有此类匹配(每个解的生成时间为多项式时间)。这为市场设计者提供了:(i)一种检验受指派约束的稳定匹配可行性的工具,以及(ii)一种在可行时实施这些匹配的工具。

英文摘要:

In this paper we consider stable matchings subject to assignment constraints. These are matchings that require certain assigned pairs to be included, insist that some other assigned pairs are not, and, importantly, are stable. Our main contribution is an algorithm, based on the iterated deletion of unattractive alternatives, that determines if assignment constraints are compatible with stability. Whenever there is a stable matching that satisfies the assignment constraints, our algorithm outputs all of them (each in polynomial time per solution). This provides market designers with (i) a tool to test the feasibility of stable matchings subject to assignment constraints, and (ii) a tool to implement them when feasible.

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

↑