The prevalent affirmative action policy in school choice limits the number of admitted majority students to give minority students higher chances to attend their desired schools. There have been numerous efforts to reconcile affirmative action policies with celebrated matching mechanisms such as...

We generalize the school choice problem by defining a notion of allowable priority violations. In this setting, a weak axiom of stability (partial stability) allows only certain priority violations. We introduce a class of algorithms called the Student Exchange under Partial Fairness (SEPF)....

Extensive evidence suggests that participants in the direct student-proposing deferred-acceptance mechanism (DSPDA) play dominated strategies. In particular, students with low priority tend to misrepresent their preferences for popular schools. To explain the observed data, we introduce...

We introduce a generalization of the school choice problem motivated by the following observations: students are assigned to grades within schools, many students have siblings who are applying as well, and school districts commonly guarantee that siblings will attend the same school. This last...

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

School choice aims to improve (1) the matching between children and schools and (2) students' educational outcomes. Yet, the concern is that disadvantaged families are less able to exercise choice, which raises (3) equity concerns. The Boston mechanism (BM) is a procedure that is widely used...

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

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

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