Controlled choice over public schools attempts giving parents selection options while maintaining diversity of di fferent student types. In practice, diversity constraints are often enforced by setting hard upper bounds and hard lower bounds for each student type. We demonstrate that, with hard...

Truthful revelation of preferences has emerged as a desideratum in the design of school choice programs. Gale-Shapley's deferred acceptance mechanism is strategy-proof for students but limits their ability to communicate their preference intensities. This results in ex-ante inefficiency when...

We provide a school choice model where the student priority orders are allowed not to be total. We introduce a class of algorithms each of which derive a student optimal stable matching once we have an initial stable matching. Since there is a method to derive a stable matching, we can derive a...

We consider school choice problems (Abdulkadiroglu and Sönmez, 2003) where students are assigned to public schools through a centralized assignment mechanism. We study the family of so-called rank-priority mechanisms, each of which is induced by an order of rank-priority pairs. Following the...

This paper characterizes the top trading cycles mechanism for the school choice problem. Schools may have multiple available seats to be assigned to students. For each school a strict priority ordering of students is determined by the school district. Each student has strict preference over the...

The Boston mechanism is among the most popular school choice procedures in use. Yet, the mechanism has been criticized for its poor incentive and welfare performances, which led the Boston Public Schools to recently replace it with Gale and Shapley's deferred acceptance algorithm (henceforth,...

The Boston mechanism is among the most popular school choice procedures in use. Yet, the mechanism has been criticized for its poor incentive and welfare performances, which led the Boston Public Schools to recently replace it with Gale and Shapley's deferred acceptance algorithm (henceforth,...

I provide a brief introduction to the early literatures on Matching, Auctions, and Market Design.The design of matching markets and auctions has brought economic theory and practice together. Indeed, this is an area where microeconomic theory has had its largest direct impact. This is in part...

We study the allocation of indivisible objects under the general endowment structures proposed by Pápai (2000) – the consistent inheritance structures – which specify the initial endowment of objects and also the inheritance of remaining objects after subsets of agents are matched and...

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