Theory points to a potential trade-off between two main school assignment mechanisms; Boston and Deferred Acceptance (DA). While DA is strategy-proof and gives a stable matching, Boston might outperform DA in terms of ex-ante efficiency. We quantify the (dis)advantages of the mechanisms by using...

Theory points to a potential trade-off between two main school assignment mechanisms; Boston and Deferred Acceptance (DA). While DA is strategy-proof and gives a stable matching, Boston might outperform DA in terms of ex-ante efficiency. We quantify the (dis)advantages of the mechanisms by using...

We present a survey of the emerging literature on the design of matching markets. We survey the articles on discrete resource allocation problems, their solutions, and their applications in three related domains. The first domain gives the theoretical background regarding the basic models,...

We show that Ergin & Sönmez's (2006) results which show that for schools it is a dominant strategy to truthfully rank the students under the Boston mechanism, and that the Nash equilibrium outcomes in undominated strategies of the induced game are stable, rely crucially on two assumptions....