In a school choice problem each school has a priority ordering over students. These priority orderings depend on criteria such as whether a student lives within walking distance or has a sibling already at the school. We argue that by including just the priority orderings in the problem, and not...

We revisit the school choice problem with consent proposed by Kesten [12], which seeks to improve the efficiency of the student-optimal deferred acceptance algorithm (DA) by obtaining students' consent to give up their priorities. We observe that for students to consent, we should use their...

The Boston mechanism is a popular student-placement mechanism in school-choice programs around the world. We provide two characterizations of the Boston mechanism. We introduce two new axioms; favoring higher ranks and rank-respecting invariance. A mechanism is the Boston mechanism for some...

The literature on school choice assumes that families can submit a preference list over all the schools they want to be assigned to. However, in many real-life instances families are only allowed to submit a list containing a limited number of schools. Subjects' incentives are drastically...

The literature on school choice assumes that families can submit a preference list over all the schools they want to be assigned to. However, in many real-life instances families are only allowed to submit a list containing a limited number of schools. Subjects' incentives are drastically...

Recently, several school districts in the US have adopted or consider adopting the Student-Optimal Stable mechanism or the Top Trading Cycles mechanism to assign children to public schools. There is evidence that for school districts that employ (variants of) the so-called Boston mechanism the...