Lotteries in Student Assignment: An Equivalence Result
This paper formally examines two competing methods of conducting a lottery in assigning students to schools, motivated by the design of the centralized high school student assignment system in New York City. The main result of the paper is that a single and multiple lottery mechanism are equivalent for the problem of allocating students to schools in which students have strict preferences and the schools are indifferent. In proving this result, a new approach is introduced, that simplifies and unifies all the known equivalence results in the house allocation literature. Along the way, two new mechanisms -- Partitioned Random Priority and Partitioned Random Endowment -- are introduced for the house allocation problem. These mechanisms generalize widely studied mechanisms for the house allocation problem and may be appropriate for the many-to-one setting such as the school choice problem.
|Date of creation:||Jun 2010|
|Date of revision:|
|Publication status:||published as Pathak, Parag A. & Jay Sethuraman. "Lotteries in student assignment: An equivalence result." Theoretical Economics 6, 1 (2011): 1-17.|
|Contact details of provider:|| Postal: |
Web page: http://www.nber.org
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Atila Abdulkadiroğlu & Parag A. Pathak & Alvin E. Roth, 2005.
"The New York City High School Match,"
American Economic Review,
American Economic Association, vol. 95(2), pages 364-367, May.
When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:16140. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.