跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 06:41 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 07:03 — 2026-11-22 07:03(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 06:41最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 06:39(北京时间)
版本更新 · v5arXiv:2501.15422

TTC Domains

Sumit Goel, Yuki Tamura

原文摘要

The Top Trading Cycles (TTC) rule is fundamental to object reallocation: it is the only rule that is individually rational, pair efficient, and strategyproof on the unrestricted domain. Despite its desirable properties, at some profiles, TTC precludes longer trading cycles that could lead to more appealing allocations. We explore restricted preference domains as an avenue for finding alternative rules satisfying the three axioms. Our main contribution is to introduce a richness condition on domains, the top-two condition, and show that it characterizes TTC domains: domains to which the above characterization of TTC extends. 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. For every domain that fails the top-two condition, we construct a rule distinct from TTC that is individually rational, Pareto efficient, and strategyproof, and that executes longer trading cycles that TTC precludes.

econ.TH · cs.GT