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 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 a new axiom, respect of preference rankings. A mechanism is the Boston mechanism for some priority if and only if it...

Distributional constraints are common features in many real matching markets, such as medical residency matching, school admissions, and teacher assignment. We develop a general theory of matching mechanisms under distributional constraints. We identify the necessary and sufficient condition on...

We study the effect of different school choice mechanisms on schools' incentives for quality improvement. To do so, we introduce the following criterion: A mechanism respects improvements of school quality if each school becomes weakly better off whenever that school becomes more preferred by...

Roth is the major force in creating a vibrant field of matching theory and its application to market design. In doing so, he has discovered many properties of the stable matching problem (especially from the strategic viewpoint of game theory), studied real-life cases to test the relevance of...

This paper investigates the welfare effects of affirmative action policies in school choice. We show that affirmative action policies can have perverse consequences. Specifically, we demonstrate that there are market situations in which affirmative action policies inevitably hurt every minority...

Distributional constraints are common features in many real matching markets, such as medical residency matching, school admissions, and teacher assignment. We develop a general theory of matching mechanisms under distributional constraints. We identify the necessary and sufficient condition on...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...