Lotteries in student assignment: An equivalence result
Parag Pathak and
Jay Sethuraman ()
Additional contact information
Jay Sethuraman: Department of Industrial Engineering and Operations Research, Columbia University,
Theoretical Economics, 2011, vol. 6, issue 1
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.
Keywords: Matching; random assignment (search for similar items in EconPapers)
JEL-codes: C78 D63 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (37) Track citations by RSS feed
Downloads: (external link)
Working Paper: Lotteries in Student Assignment: An Equivalence Result (2010)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:the:publsh:816
Access Statistics for this article
Theoretical Economics is currently edited by Simon Board, Federico Echenique, Thomas Mariotti, Florian Scheuer, Ran Spiegler
More articles in Theoretical Economics from Econometric Society
Bibliographic data for series maintained by Martin J. Osborne ().