TTC 域
TTC Domains
AI总结：
研究在受限偏好域上，基于个体理性、效率与策略证明性的TTC刻画是否成立，提出top-two条件并证明其充分性及部分逆命题。
摘要：
针对物品再分配问题，我们研究基于个体理性、效率与策略证明性的Top Trading Cycles (TTC) 特征刻画是否从无限制域扩展到受限偏好域。我们引入top-two条件，并证明它为回答该问题提供了有用准则。该条件要求：在每个物品子集内，任何两个均可排在第一的物品也能以两种可能顺序排在前两位。我们首先证明该条件是充分的：在每个满足top-two条件的域上，TTC是满足相关公理的唯一规则。我们还给出了部分逆命题：对于在某个小物品子集内不满足top-two条件且满足温和扩展条件的域，我们构造了一个不同于TTC的规则满足这些公理。我们的结果为特定域（如单峰域和单谷域）的现有发现提供了统一视角，同时也处理了几个先前未探索的域，包括循环域和部分一致域。
英文摘要：
For the object reallocation problem, we study whether characterizations of Top Trading Cycles (TTC) based on individual rationality, efficiency, and strategyproofness on the unrestricted domain extend to restricted preference domains. We introduce the top-two condition and show that it offers a useful criterion for answering this question. The condition requires that, within every subset of objects, any two objects that can each be ranked first can also be ranked as the top two, in both possible orders. We first show that this condition is sufficient: on every domain satisfying the top-two condition, TTC is the unique rule satisfying the relevant axioms. We also provide a partial converse. For domains that fail the top-two condition within a small subset of objects and satisfy a mild extension condition, we construct a rule distinct from TTC satisfying these axioms. Our results provide a unifying perspective on existing findings for specific domains, such as the single-peaked and single-dipped domains, while also addressing several previously unexplored domains, including the circular and partial-agreement domains.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
