论文标题
在Matroid约束下强烈稳定的比赛
Strongly Stable Matchings under Matroid Constraints
论文作者
论文摘要
我们考虑稳定匹配问题的众多变体。更具体地说，我们考虑了一侧具有矩形约束的稳定匹配问题的变体。此外，我们考虑了每个代理商可能包含关系的情况。在这种情况下，我们考虑检查存在强稳定匹配的存在的问题，如果存在强稳定的匹配，则发现强烈稳定的匹配。我们为此问题提出了多项式时间算法。
We consider a many-to-one variant of the stable matching problem. More concretely, we consider the variant of the stable matching problem where one side has a matroid constraint. Furthermore, we consider the situation where the preference of each agent may contain ties. In this setting, we consider the problem of checking the existence of a strongly stable matching, and finding a strongly stable matching if a strongly stable matching exists. We propose a polynomial-time algorithm for this problem.
