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

  • Eric Budish
  • Estelle Cantillon

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: https://dipot.ulb.ac.be/dspace/bitstream/2013/99376/1/AER-20091443-manuscript.pdf
Download Restriction: no

File URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/99376/3/budish-cantillon-multiunit-assignment-aer-2012.pdf
Download Restriction: only accessible to specific communities

Bibliographic Info

Paper provided by ULB -- Universite Libre de Bruxelles in its series ULB Institutional Repository with number 2013/99376.

as in new window
Length:
Date of creation: 2012
Date of revision:
Publication status: Published in: The American economic review (2012) v.102 n° 5,p.2237-71
Handle: RePEc:ulb:ulbeco:2013/99376

Contact details of provider:
Postal: CP135, 50, avenue F.D. Roosevelt, 1050 Bruxelles
Web page: http://difusion.ulb.ac.be
More information through EDIRC

Related research

Keywords: Multi-unit assignment; market design; course allocation; random serial dictatorship;

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. Dirk Bergemann & Stephen Morris, 2003. "Robust Mechanism Design," Levine's Bibliography 666156000000000035, UCLA Department of Economics.
  2. Yeon-Koo Che & Fuhito Kojima, 2008. "Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms," Cowles Foundation Discussion Papers 1677, Cowles Foundation for Research in Economics, Yale University.
  3. 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.
  4. 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.
  5. Atila Abdulkadiroğlu & Yeon-Koo Che & Yosuke Yasuda, 2010. "Expanding “Choice” in School Choice," Levine's Working Paper Archive 661465000000000062, David K. Levine.
  6. Varian, Hal R., 2007. "Position auctions," International Journal of Industrial Organization, Elsevier, vol. 25(6), pages 1163-1178, December.
  7. Drew Fudenberg & Jean Tirole, 1991. "Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061414, December.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. EHLERS, Lars & MASSÓ, Jordi, 2007. "Matching Markets under (In)complete Information," Cahiers de recherche 01-2007, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
  13. Tayfun Sonmez & M. Utku Unver, 2003. "Course Bidding at Business Schools," Game Theory and Information 0306001, EconWPA, revised 02 Jan 2004.
  14. Peter Coles & Alexey Kushnir & Muriel Niederle, 2013. "Preference Signaling in Matching Markets," American Economic Journal: Microeconomics, American Economic Association, vol. 5(2), pages 99-134, May.
  15. 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.
  16. Brams,Steven J. & Taylor,Alan D., 1996. "Fair Division," Cambridge Books, Cambridge University Press, number 9780521556446, April.
  17. 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.
  18. Alvin E. Roth, 2007. "What Have We Learned From Market Design?," NBER Working Papers 13530, National Bureau of Economic Research, Inc.
  19. 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.
  20. 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.
  21. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
  22. 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.
  23. Manea, Mihai, 2007. "Serial dictatorship and Pareto optimality," Games and Economic Behavior, Elsevier, vol. 61(2), pages 316-330, November.
  24. Tayfun Sonmez, 1999. "Strategy-Proofness and Essentially Single-Valued Cores," Econometrica, Econometric Society, vol. 67(3), pages 677-690, May.
  25. 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.
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. 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.
  2. EHLERS, Lars & WESTKAMP, Alexander, 2011. "Strategy-Proof Tie-Breaking," Cahiers de recherche 2011-07, Universite de Montreal, Departement de sciences economiques.
  3. 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.
  4. Chen, Ning & Li, Mengling, 2013. "Ties matter: improving efficiency in course allocation by introducing ties," MPRA Paper 47031, University Library of Munich, Germany.
  5. Tayfun S�nmez, 2013. "Bidding for Army Career Specialties: Improving the ROTC Branching Mechanism," Journal of Political Economy, University of Chicago Press, vol. 121(1), pages 186 - 219.
  6. Aziz, Haris & Brandt, Felix & Brill, Markus, 2013. "The computational complexity of random serial dictatorship," Economics Letters, Elsevier, vol. 121(3), pages 341-345.
  7. Mariagiovanna Baccara & Ayse Imrohoroglu & Alistair J. Wilson & Leeat Yariv, 2012. "A Field Study on Matching with Network Externalities," American Economic Review, American Economic Association, vol. 102(5), pages 1773-1804, August.
  8. Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.
  9. 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.
  10. Daniel Monte & Norovsambuu Tumennasan, 2012. "Centralized Allocation in Multiple Markets," Economics Working Papers 2012-09, School of Economics and Management, University of Aarhus.
  11. 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.
  12. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.

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:ulb:ulbeco:2013/99376. 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: (Benoit Pauwels).

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.