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...

Despite the truthful dominant strategy, participants in strategy-proof me- chanisms submit manipulated preferences. In our model, participants dislike rejections and enjoy the confirmation from getting what they declared most desirable. Formally, the payoff from a match decreases in its position...

This paper studies heterogeneity in schooling decisions by socio-economic status (SES) in response to a repeal of achievement-based admissions requirements (i.e. binding track recommendations) in Germany's between-school tracking system. The main contribution is to show that while previously...

We study preferences over procedures in the presence of naive agents. We employ a school choice setting following Pathak and Sönmez (2008) who show that sophisticated agents are better off under the Boston mechanism than under a strategy-proof mechanism if some agents are sincere. We use lab...

Students participating in centralized admissions procedures do not typically have access to the information used to determine their matched school, such as other students' preferences or school priorities. This can lead to doubts about whether their matched schools were computed correctly (the...

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...

How should students be assigned to schools? Two mechanisms have been suggested and implemented around the world: deferred acceptance (DA) and top trading cycles (TTC). These two mechanisms are widely considered excellent choices because they are strategy-proof, in addition to DA's no justified...

We study iterated formation of mutually best matches (IMB) in college admissions problems. When IMB produces a maximal individually rational matching, the matching has many good properties like Pareto optimality and stability. If preferences satisfy a single peakedness condition, or have a...