Strategy-Proof Stochastic Assignment
AbstractI study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is highly restrictive when the mechanism involves randomization. In fact, the Random Priority mechanism (i.e., the Random Serial Dictatorship), and a recently adopted school choice mechanism, Deferred Acceptance with Random Tie-breaking, are wasteful. I find that both these mechanisms are dominated by strategy-proof mechanisms. In general, strategy-proof improvement cannot be due to merely reshuffling objects, and therefore must involve assigning more objects. Forthcoming in
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Faculty of Economics, University of Cambridge in its series Cambridge Working Papers in Economics with number 1333.
Date of creation: 26 Sep 2013
Date of revision:
Contact details of provider:
Web page: http://www.econ.cam.ac.uk/index.htm
This paper has been announced in the following NEP Reports:
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.:
- Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
- Storcken A.J.A. & Peters H.J.M. & Roy S. & Sen A., 2013.
"Probabilistic Strategy-Proof Rules over Single-Peaked Domains,"
040, Maastricht : GSBE, Graduate School of Business and Economics.
- Storcken A.J.A. & Peters H.J.M. & Roy S. & Sen A., 2013. "Probabilistic Strategy-Proof Rules over Single-Peaked Domains," Research Memorandum 040, Maastricht University, Graduate School of Business and Economics (GSBE).
- Pathak, Parag A. & Sethuraman, Jay, 2011.
"Lotteries in student assignment: An equivalence result,"
Econometric Society, vol. 6(1), January.
- Parag A. Pathak & Jay Sethuraman, 2010. "Lotteries in Student Assignment: An Equivalence Result," NBER Working Papers 16140, National Bureau of Economic Research, Inc.
- EHLERS, Lars, 2006.
"Respecting Priorities when Assigning Students to Schools,"
Cahiers de recherche
04-2006, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- EHLERS, Lars, 2006. "Respecting Priorities when Assigning Students to Schools," Cahiers de recherche 2006-04, Universite de Montreal, Departement de sciences economiques.
- Kesten, Onur & Kurino, Morimitsu, 2012. "On the (im)possibility of improving upon the student-proposing deferred acceptance mechanism," Discussion Papers, Research Unit: Market Behavior SP II 2012-202, Social Science Research Center Berlin (WZB).
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Howard Cobb).
If references are entirely missing, you can add them using this form.