Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
The random priority (random serial dictatorship) mechanism is a common method for assigning objects. The mechanism is easy to implement and strategy-proof. However, this mechanism is inefficient, because all agents may be made better off by another mechanism that increases their chances of obtaining more preferred objects. This form of inefficiency is eliminated by a mechanism called probabilistic serial, but this mechanism is not strategy-proof. Thus, which mechanism to employ in practical applications is an open question. We show that these mechanisms become equivalent when the market becomes large. More specifically, given a set of object types, the random assignments in these mechanisms converge to each other as the number of copies of each object type approaches infinity. Thus, the inefficiency of the random priority mechanism becomes small in large markets. Our result gives some rationale for the common use of the random priority mechanism in practical problems such as student placement in public schools. Copyright 2010 The Econometric Society.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 78 (2010)
Issue (Month): 5 (09)
|Contact details of provider:|| Phone: 1 212 998 3820|
Fax: 1 212 995 4487
Web page: http://www.econometricsociety.org/
More information through EDIRC
|Order Information:|| Web: https://www.econometricsociety.org/publications/econometrica/access/ordering-back-issues Email: |
References listed on IDEAS
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.:
- McLennan, Andrew, 2002. "Ordinal Efficiency and the Polyhedral Separating Hyperplane Theorem," Journal of Economic Theory, Elsevier, vol. 105(2), pages 435-449, August.
- Jackson, Matthew O. & Manelli, Alejandro M., 1997. "Approximately Competitive Equilibria in Large Finite Economies," Journal of Economic Theory, Elsevier, vol. 77(2), pages 354-376, December.
- Hylland, Aanund & Zeckhauser, Richard, 1979. "The Efficient Allocation of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 87(2), pages 293-314, April.
- Hervé Crès & Hervé Moulin, 1998.
"Scheduling with Opting Out: Improving Upon Random Priority,"
- Moulin, Herve & Cres, Moulin, 2000. "Scheduling with Opting Out: Improving upon Random Priority," Working Papers 2000-03, Rice University, Department of Economics.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
- Manea, Mihai, 2009. "Asymptotic ordinal inefficiency of random serial dictatorship," Theoretical Economics, Econometric Society, vol. 4(2), June.
- Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
- Atila Abdulkadiroğlu & Yeon-Koo Che & Yosuke Yasuda, 2010.
"Expanding “Choice” in School Choice,"
Levine's Working Paper Archive
661465000000000062, David K. Levine.
- Atila Abdulkadiroglu & Yeon-Koo Che & Yosuke Yasuda, 2008. "Expanding "Choice" in School Choice," GRIPS Discussion Papers 08-17, National Graduate Institute for Policy Studies.
- Atila Abdulkadiroglu & Yeon-Koo Che & Yosuke Yasuda, 2010. "Expanding 'Choice' in School Choice," Working Papers 10-23, Duke University, Department of Economics.
- Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
- SÃ¶nmez, Tayfun & Pathak, Parag A. & Abdulkadiroglu, Atila & Roth, Alvin, 2005.
"The Boston Public School Match,"
2562764, Harvard University Department of Economics.
- 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.
- Martin W. Cripps & Jeroen M. Swinkels, 2006.
"Efficiency of Large Double Auctions,"
Econometric Society, vol. 74(1), pages 47-92, 01.
- 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.
- Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
- Sun, Yeneng, 2006. "The exact law of large numbers via Fubini extension and characterization of insurable risks," Journal of Economic Theory, Elsevier, vol. 126(1), pages 31-69, January.
- Yan Chen & Tayfun Sönmez, 2002. "Improving Efficiency of On-Campus Housing: An Experimental Study," American Economic Review, American Economic Association, vol. 92(5), pages 1669-1686, December.
- Judd, Kenneth L., 1985. "The law of large numbers with a continuum of IID random variables," Journal of Economic Theory, Elsevier, vol. 35(1), pages 19-25, February.
- Jackson, Matthew O., 1992. "Incentive compatibility and competitive allocations," Economics Letters, Elsevier, vol. 40(3), pages 299-302, November.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:78:y:2010:i:5:p:1625-1672. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing)or (Christopher F. Baum)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.