标题： 基于优先权的匹配中的有限远见 显示英文标题

标题： Limited Farsightedness in Priority-Based Matching

摘要： 我们考虑有限远见的优先匹配问题。 我们证明，一旦代理人足够远见，从顶点交易循环（TTC）算法得到的匹配将是稳定的：如果远见程度大于TTC中最大循环的代理人数量的三倍，则由TTC匹配组成的单例集是一个 horizon-$k$ vNM 稳定集。 相反，从延迟接受（DA）算法得到的匹配可能不属于任何 horizon-$k$ vNM 稳定集，当$k$足够大时。 显示英文摘要

摘要： We consider priority-based matching problems with limited farsightedness. We show that, once agents are sufficiently farsighted, the matching obtained from the Top Trading Cycles (TTC) algorithm becomes stable: a singleton set consisting of the TTC matching is a horizon-$k$ vNM stable set if the degree of farsightedness is greater than three times the number of agents in the largest cycle of the TTC. On the contrary, the matching obtained from the Deferred Acceptance (DA) algorithm may not belong to any horizon-$k$ vNM stable set for $k$ large enough.