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

Unsophisticated applicants can be at a disadvantage under manipulable and hence strategically demanding school choice mechanisms. Disclosing information on applications in previous admission periods makes it easier to asses the chances of being admitted at a particular school, and hence may...

We take school admission mechanisms to the lab to test whether the widely-used manipulable Boston-mechanism disadvantages students of lower cognitive ability and whether this leads to ability segregation across schools. Results show this is the case: lower ability participants receive lower...

Unsophisticated applicants can be at a disadvantage under manipulable and hence strategically demanding school choice mechanisms. Disclosing information on applications in previous admission periods makes it easier to assess the chances of being admitted at a particular school, and hence may...

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

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

Evidence suggests that participants in direct student-proposing deferred-acceptance mechanisms (DA) play dominated strategies. To explain the data, we introduce expectation-based loss aversion into a school-choice setting and characterize choice-acclimating personal equilibria in DA. We find...

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

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