Advanced Search
MyIDEAS: Login to save this paper or follow this series

The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard

Contents:

Author Info

  • Budish, Eric
  • Cantillon, Estelle

Abstract

This paper uses data consisting of students' strategically reported preferences and their underlying true preferences to study the course allocation mechanism used at Harvard Business School. We show that the mechanism is manipulable in theory, manipulated in practice, and that these manipulations cause meaningful welfare losses. However, we also find that ex-ante welfare is higher than under the strategyproof and ex-post efficient alternative, the Random Serial Dictatorship. We trace the poor ex-ante performance of RSD to a phenomenon specific to multi-unit assignment, "callousness". We draw lessons for the design of multi-unit assignment mechanisms and for market design more broadly.

Download Info

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.
File URL: http://www.cepr.org/pubs/dps/DP7641.asp
Download Restriction: CEPR Discussion Papers are free to download for our researchers, subscribers and members. If you fall into one of these categories but have trouble downloading our papers, please contact us at subscribers@cepr.org

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.

Bibliographic Info

Paper provided by C.E.P.R. Discussion Papers in its series CEPR Discussion Papers with number 7641.

as in new window
Length:
Date of creation: Jan 2010
Date of revision:
Handle: RePEc:cpr:ceprdp:7641

Contact details of provider:
Postal: Centre for Economic Policy Research, 77 Bastwick Street, London EC1V 3PZ.
Phone: 44 - 20 - 7183 8801
Fax: 44 - 20 - 7183 8820

Order Information:
Email:

Related research

Keywords: course allocation; dictatorship; ex-ante efficiency; ex-post efficiency; field data; market design; multi-unit assignment; random serial dictatorship; strategic behaviour; strategyproofness;

Other versions of this item:

Find related papers by JEL classification:

References

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.:
as in new window
  1. Atila Abdulkadiroglu & Yeon-Koo Che & Yosuke Yasuda, 2010. "Expanding 'Choice' in School Choice," Working Papers 10-23, Duke University, Department of Economics.
  2. Steven J. Brams & Paul H. Edelman & Peter C. Fishburn, 2003. "Fair Division Of Indivisible Items," Theory and Decision, Springer, vol. 55(2), pages 147-180, 09.
  3. Drew Fudenberg & Jean Tirole, 1991. "Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061414, December.
  4. Lars Ehlers & Bettina Klaus, 2003. "Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems," Social Choice and Welfare, Springer, vol. 21(2), pages 265-280, October.
  5. Alvin E. Roth, 2009. "What Have We Learned from Market Design?," NBER Chapters, in: Innovation Policy and the Economy, Volume 9, pages 79-112 National Bureau of Economic Research, Inc.
  6. Parag A. Pathak & Tayfun Sonmez, 2008. "Leveling the Playing Field: Sincere and Sophisticated Players in the Boston Mechanism," American Economic Review, American Economic Association, vol. 98(4), pages 1636-52, September.
  7. Tayfun Sonmez, 1999. "Strategy-Proofness and Essentially Single-Valued Cores," Econometrica, Econometric Society, vol. 67(3), pages 677-690, May.
  8. Bettina Klaus & Eiichi Miyagawa, 2002. "Strategy-proofness, solidarity, and consistency for multiple assignment problems," International Journal of Game Theory, Springer, vol. 30(3), pages 421-435.
  9. Elliott Peranson & Alvin E. Roth, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," American Economic Review, American Economic Association, vol. 89(4), pages 748-780, September.
  10. Tayfun Sönmez & M. Utku Ünver, 2005. "Course Bidding at Business Schools," Boston College Working Papers in Economics 618, Boston College Department of Economics.
  11. Dirk Bergemann & Stephen Morris, 2003. "Robust Mechanism Design," Cowles Foundation Discussion Papers 1421, Cowles Foundation for Research in Economics, Yale University.
  12. Konishi, Hideo & Quint, Thomas & Wako, Jun, 2001. "On the Shapley-Scarf economy: the case of multiple types of indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 35(1), pages 1-15, February.
  13. Peter Coles & Alexey Kushnir & Muriel Niederle, 2010. "Preference Signaling in Matching Markets," NBER Working Papers 16185, National Bureau of Economic Research, Inc.
  14. John C. Harsanyi, 1953. "Cardinal Utility in Welfare Economics and in the Theory of Risk-taking," Journal of Political Economy, University of Chicago Press, vol. 61, pages 434.
  15. Nurmi, Hannu, 1996. "Fair division: From cake-cutting to dispute resolution : Steven J. Brams and Alan D. Taylor, (Cambridge University Press, Cambridge, 1995) pp. xiv + 272, US$ 54.95 (hardcover), US$ 18.95 (paper)," European Journal of Political Economy, Elsevier, vol. 12(1), pages 169-172, April.
  16. Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
  17. Varian, Hal R., 2007. "Position auctions," International Journal of Industrial Organization, Elsevier, vol. 25(6), pages 1163-1178, December.
  18. Yeon-Koo Che & Fuhito Kojima, 2010. "Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms," Econometrica, Econometric Society, vol. 78(5), pages 1625-1672, 09.
  19. Brams,Steven J. & Taylor,Alan D., 1996. "Fair Division," Cambridge Books, Cambridge University Press, number 9780521556446, April.
  20. 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.
  21. Sendhil Mullainathan & Marianne Bertrand, 2001. "Do People Mean What They Say? Implications for Subjective Survey Data," American Economic Review, American Economic Association, vol. 91(2), pages 67-72, May.
  22. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2005. "Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords," NBER Working Papers 11765, National Bureau of Economic Research, Inc.
  23. Manea, Mihai, 2007. "Serial dictatorship and Pareto optimality," Games and Economic Behavior, Elsevier, vol. 61(2), pages 316-330, November.
  24. EHLERS, Lars & MASSÓ, Jordi, 2007. "Matching Markets under (In)complete Information," Cahiers de recherche 2007-01, Universite de Montreal, Departement de sciences economiques.
  25. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061 - 1103.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Aziz, Haris & Brandt, Felix & Brill, Markus, 2013. "The computational complexity of random serial dictatorship," Economics Letters, Elsevier, vol. 121(3), pages 341-345.
  2. Chen, Ning & Li, Mengling, 2013. "Ties matter: improving efficiency in course allocation by introducing ties," MPRA Paper 47031, University Library of Munich, Germany.
  3. Jens L. Hougaard & Juan D. Moreno-Ternero & Lars P. Osterdal, 2014. "Assigning agents to a line," Working Papers 14.01, Universidad Pablo de Olavide, Department of Economics.
  4. Tayfun Sönmez & Tobias B. Switzer, 2011. "Matching with (Branch-of-Choice) Contracts at United States Military Academy," Boston College Working Papers in Economics 782, Boston College Department of Economics.
  5. EHLERS, Lars & WESTKAMP, Alexander, 2011. "Strategy-Proof Tie-Breaking," Cahiers de recherche 2011-07, Universite de Montreal, Departement de sciences economiques.
  6. Mariagiovanna Baccara & Ayse Imrohoroglu & Alistair Wilson & Leeat Yariv, 2009. "A Field Study on Matching with Network Externalities," Working Papers 09-13, New York University, Leonard N. Stern School of Business, Department of Economics.
  7. Daniel Monte & Norovsambuu Tumennasan, 2012. "Centralized Allocation in Multiple Markets," Economics Working Papers 2012-09, School of Economics and Management, University of Aarhus.
  8. Tayfun Sönmez, 2011. "Bidding for Army Career Specialties: Improving the ROTC Branching Mechanism," Boston College Working Papers in Economics 783, Boston College Department of Economics.
  9. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
  10. Wu, Binzhen & Zhong, Xiaohan, 2014. "Matching mechanisms and matching quality: Evidence from a top university in China," Games and Economic Behavior, Elsevier, vol. 84(C), pages 196-215.
  11. Franz Diebold & Haris Aziz & Martin Bichler & Florian Matthes & Alexander Schneider, 2014. "Course Allocation via Stable Matching," Business & Information Systems Engineering, Springer, vol. 6(2), pages 97-110, April.
  12. Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.

Lists

This item is featured on the following reading lists or Wikipedia pages:
  1. The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard (AER 2012) in ReplicationWiki

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:cpr:ceprdp:7641. 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: ().

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.