We run a field experiment to test the truth-telling rates of the theoretically strategy-proof Top Trading Cycles mechanism (TTC) under different information conditions. First, we asked first-year economics students enrolled in an introductory microeconomics unit about which topic, among three,...

We test the effect of the amount of information on the strategies played by others in the theoretically strategy-proof Top Trading Cycles (TTC) mechanism. We find that providing limited information on the strategies played by others has a negative and significant effect in truth-telling rates...

The use of lotteries is advocated to desegregate schools. We study lottery quotas embedded in the two most common school choice mechanisms, namely deferred and immediate acceptance mechanisms. Some seats are allocated based on merit (e.g., grades) and some based on lottery draws. We focus on the...

We show that Ergin & Sönmez's (2006) results which show that for schools it is a dominant strategy to truthfully rank the students under the Boston mechanism, and that the Nash equilibrium outcomes in undominated strategies of the induced game are stable, rely crucially on two assumptions....

In school choice problems, the widely used manipulable Immediate Acceptance mechanism (IA) disadvantages unsophisticated applicants, but may ex-ante Pareto dominate any strategy-proof alternative. In these cases, it may be preferable to aid applicants within IA, rather than to abandon it. In a...

We investigate fairness preferences in matching mechanisms using a spectator design. Participants choose between the Boston mechanism or the serial dictatorship mechanism (SD) played by others. In our setup, the Boston mechanism generates justified envy, while the strategy-proof SD ensures...

A particular adaptation of Gale's top trading cycles procedure to school choice, the so-called TTC mechanism, has attracted much attention both in theory and practice due to its superior efficiency and incentive features. We discuss and introduce alternative adaptations of Gale's original...

We evaluate the goal of maximizing the number of individually rational assignments. We show that it implies incentive, fairness, and implementation impossibilities. Despite that, we present two classes of mechanisms that maximize assignments. The first are Pareto efficient, and undominated - in...

We characterize a parametric family of application-rejection school choice mechanisms, including the Boston and Deferred Acceptance mechanisms as special cases, and spanning the parallel mechanisms for Chinese college admissions, the largest centralized matching in the world. Moving from one...