Browsing by Author "Roth, Alvin E"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
Item Open Access Changing the Boston School Choice Mechanism(2006) Abdulkadiroglu, Atila; Pathak, Parag A; Roth, Alvin E; Sonmez, Tayfun05 the Boston School Committee voted to replace the existing Boston school choice mechanism with a deferred acceptance mechanism that simplifies the strategic choices facing parents. This paper presents the empirical case against the previous Boston mechanism, a priority matching mechanism, and the case in favor of the change to a strategy-proof mechanism. Using detailed records on student choices and assignments, we present evidence both of sophisticated strategic behavior among some parents, and of unsophisticated strategic behavior by others. We find evidence that some parents pay close attention to the capacity constraints of different schools, while others appear not to. In particular, we show that many unassigned students could have been assigned to one of their stated choices with a different strategy under the current mechanism. This interaction between sophisticated and unsophisticated players identifies a new rationale for strategy-proof mechanisms based on fairness, and was a critical argument in Boston's decision to change the mechanism. We then discuss the considerations that led to the adoption of a deferred acceptance mechanism as opposed to the (also strategy-proof) top trading cycles mechanism.Item Open Access Strategyproofness Versus Efficiency in Matching With Indifferences: Redesigning the NYC High School Match(2008) Abdulkadiroglu, Atila; Pathak, Parag A; Roth, Alvin Eof the New York City (NYC) High School match involved tradeoffs between incentives and efficiency, because some schools are strategic players that rank students in order of preference, while others order students based on large priority classes. Therefore it is desirable for a mechanism to produce stable matchings (to avoid giving the strategic players incentives to circumvent the match), but is also necessary to use tie-breaking for schools whose capacity is sufficient to accommodate some but not all students of a given priority class. We analyze a model that encompasses one-sided and two-sided matching models. We first observe that breaking indifferences the same way at every school is sufficient to produce the set of student optimal stable matchings. Our main theoretical result is that a student-proposing deferred acceptance mechanism that breaks indifferences the same way at every school is not dominated by any other mechanism that is strategyproof for students. Finally, using data from the recent redesign of the NYC High School match, which places approximately 90,000 students per year, we document that the extent of potential efficiency loss is substantial. Over 6,800 student applicants in the main round of assignment could have improved their assignment in a (non strategy-proof) student optimal mechanism, if the same student preferences would have been revealed.