Trading Cycles for School Choice
13 Pages Posted: 2 Aug 2011 Last revised: 19 Oct 2011
Date Written: July 31, 2011
Abstract
In this note we study the allocation and exchange of discrete resources in environ- ments in which monetary transfers are not allowed. We allow each discrete resource to be represented by several copies, extend onto this environment the trading cycles mechanisms of Pycia and Ünver [2009], and show that the extended mechanisms are Pareto efficient and strategy-proof. In particular, we construct the counterpart of Pápai [2000] hiererachical exchange mechanisms for environments with copies.
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
Expanding 'Choice' in School Choice
By Atila Abdulkadiroglu, Yeon-koo Che, ...
-
Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
By Yeon-koo Che and Fuhito Kojima
-
Constrained School Choice: An Experimental Study
By Guillaume Haeringer, Caterina Calsamiglia, ...
-
Characterizations of the Probabilistic Serial Mechanism
By Tadashi Hashimoto and Daisuke Hirata
-
Resolving Conflicting Preferences in School Choice: The 'Boston' Mechanism Reconsidered
By Atila Abdulkadiroglu, Yeon-koo Che, ...
-
Resolving Conflicting Preferences in School Choice: The 'Boston' Mechanism Reconsidered
By Atila Abdulkadiroglu, Yeon-koo Che, ...
-
Ex Ante Efficiency in School Choice Mechanisms: An Experimental Investigation
-
Probabilistic Assignment of Objects: Characterizing the Serial Rule
By Anna Bogomolnaia and Eun Jeong Heo
-
By Parag A. Pathak and Tayfun Sonmez
-
Lotteries in Student Assignment: An Equivalence Result
By Parag A. Pathak and Jay Sethuraman