Axioms for Top Trading Cycles in Multi-Object Reallocation
Jacob Coreno, Di Feng

TL;DR
This paper characterizes the axiomatic foundations of the Top Trading Cycles rule for multi-object reallocation without money, across various preference domains, highlighting its efficiency and strategy-proofness properties.
Contribution
It provides new axiomatic characterizations of TTC in multiple domains, including lexicographic, responsive, and conditionally lexicographic, extending its theoretical understanding.
Findings
TTC is characterized by balancedness and efficiency on the lexicographic domain.
On the responsive domain, TTC is unique with efficiency and truncation-proofness.
In the Shapley--Scarf market, TTC satisfies Pareto efficiency and individual rationality.
Abstract
This paper studies multi-object reallocation without monetary transfers, where agents initially own multiple indivisible objects and have strict preferences over bundles (e.g., shift exchange among workers at a firm). Focusing on marginal rules that elicit only rankings over individual objects, we provide axiomatic characterizations of the generalized Top Trading Cycles rule (TTC) on the lexicographic and responsive domains. On the lexicographic domain, TTC is characterized by balancedness, individual-good efficiency, the worst-endowment lower bound, and either truncation-proofness or drop strategy-proofness. On the responsive domain, TTC is the unique marginal rule satisfying individual-good efficiency, truncation-proofness, and either the worst-endowment lower bound or individual rationality. In the Shapley--Scarf housing market, TTC is characterized by Pareto efficiency, individual…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Matrix Theory and Algorithms · Optimization and Search Problems
MethodsSCARF · Focus
