2013/01/28 by Parag A Pathak, Parag A. Pathak, Tayfun Sönmez · 324 citations
Computer Science · Economics, Econometrics and Finance · Engineering · Mathematics · #Computer science #Computer security #Economics #Engineering #Game Theory and Voting Systems #Internet Traffic Analysis and Secure E-voting #Legal and Constitutional Studies #Mathematics #Mechanism (biology) #Midstream #Political science #Public administration #Rank (graph theory) #Sociology #Vulnerability (computing)
paper · doi:10.1257/aer.103.1.80
published in American Economic Review 103(1), 80-106 (American Economic Association)
openalex publication_date 2013/01/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/11
In Fall 2009, Chicago authorities abandoned a school assignment mechanism midstream, citing concerns about its vulnerability to manipulation. Nonetheless, they asked thousands of applicants to re-rank schools in a new mechanism that is also manipulable. This paper introduces a method to compare mechanisms by their vulnerability to manipulation. Our methodology formalizes how the old mechanism is at least as manipulable as any other plausible mechanism, including the new one. A number of similar transitions took place in England after the widely popular Boston mechanism was ruled illegal in 2007. Our approach provides support for these and other recent policy changes. (JEL C78, D82, H75, I21, I28)