IDEAS home Printed from https://ideas.repec.org/p/nbr/nberwo/22448.html
   My bibliography  Save this paper

Can Market Participants Report their Preferences Accurately (Enough)?

Author

Listed:
  • Eric Budish
  • Judd B. Kessler

Abstract

In mechanism design theory it is common to assume that agents can perfectly report their preferences, even in complex settings where this assumption strains reality. We experimentally test whether real market participants can report their real preferences for course schedules “accurately enough” for a novel course allocation mechanism, approximate competitive equilibrium from equal incomes (A-CEEI), to realize its theoretical benefits. To use market participants’ real preferences (i.e., rather than artificial “induced preferences” as is typical in market design experiments), we developed a new experimental method. Our method, the “elicited preferences” approach, generates preference data from subjects through a series of binary choices. These binary choices revealed that subjects preferred their schedules constructed under A-CEEI to their schedules constructed under the incumbent mechanism, a bidding points auction, and that A-CEEI reduced envy, suggesting subjects were able to report their preferences accurately enough to realize the efficiency and fairness benefits of A-CEEI. However, preference reporting mistakes did meaningfully harm mechanism performance. One identifiable pattern of mistakes was that subjects had relatively more difficulty reporting cardinal as opposed to ordinal preference information. The experiment helped to persuade the Wharton School to adopt the new mechanism and helped guide aspects of its practical implementation, especially around preference reporting.

Suggested Citation

  • Eric Budish & Judd B. Kessler, 2016. "Can Market Participants Report their Preferences Accurately (Enough)?," NBER Working Papers 22448, National Bureau of Economic Research, Inc.
  • Handle: RePEc:nbr:nberwo:22448
    Note: IO
    as

    Download full text from publisher

    File URL: http://www.nber.org/papers/w22448.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lars Ehlers & Bettina Klaus, 2003. "Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 265-280, October.
    2. Alvin E. Roth, 2009. "What Have We Learned from Market Design?," Innovation Policy and the Economy, University of Chicago Press, vol. 9(1), pages 79-112.
    3. Aradhna Krishna & M. Utku Ünver, 2008. "Research Note—Improving the Efficiency of Course Bidding at Business Schools: Field and Laboratory Studies," Marketing Science, INFORMS, vol. 27(2), pages 262-282, 03-04.
    4. Arnsperger, Christian, 1994. "Envy-Freeness and Distributive Justice," Journal of Economic Surveys, Wiley Blackwell, vol. 8(2), pages 155-186, June.
    5. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    6. Muriel Niederle & Lise Vesterlund, 2007. "Do Women Shy Away From Competition? Do Men Compete Too Much?," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 122(3), pages 1067-1101.
    7. Paul Klemperer, 2004. "Auctions: Theory and Practice," Online economics textbooks, SUNY-Oswego, Department of Economics, number auction1.
    8. Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-2271, August.
    9. John H. Kagel & Yuanchuan Lien & Paul Milgrom, 2010. "Ascending Prices and Package Bidding: A Theoretical and Experimental Analysis," American Economic Journal: Microeconomics, American Economic Association, vol. 2(3), pages 160-185, August.
    10. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Boston College Working Papers in Economics 639, Boston College Department of Economics.
    11. Kessler, Judd B. & Roth, Alvin E., 2014. "Loopholes undermine donation: An experiment motivated by an organ donation priority loophole in Israel," Journal of Public Economics, Elsevier, vol. 114(C), pages 19-28.
    12. Drew Fudenberg & Jean Tirole, 1991. "Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061414, December.
    13. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    14. Mar Reguant, 2014. "Complementary Bidding Mechanisms and Startup Costs in Electricity Markets," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 81(4), pages 1708-1742.
    15. Parag A. Pathak & Tayfun Sönmez, 2013. "School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to Manipulation," American Economic Review, American Economic Association, vol. 103(1), pages 80-106, February.
    16. Kahneman, Daniel & Knetsch, Jack L & Thaler, Richard H, 1990. "Experimental Tests of the Endowment Effect and the Coase Theorem," Journal of Political Economy, University of Chicago Press, vol. 98(6), pages 1325-1348, December.
    17. Tayfun Sönmez & Tobias B. Switzer, 2013. "Matching With (Branch‐of‐Choice) Contracts at the United States Military Academy," Econometrica, Econometric Society, vol. 81(2), pages 451-488, March.
    18. Judd B. Kessler & Alvin E. Roth, 2012. "Organ Allocation Policy and the Decision to Donate," American Economic Review, American Economic Association, vol. 102(5), pages 2018-2047, August.
    19. Peter Cramton & Yoav Shoham & Richard Steinberg (ed.), 2006. "Combinatorial Auctions," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262033429, December.
    20. John H. Kagel & Alvin E. Roth, 2000. "The Dynamics of Reorganization in Matching Markets: A Laboratory Experiment Motivated by a Natural Experiment," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 115(1), pages 201-235.
    21. Tayfun Sönmez & Alvin E. Roth & M. Utku Ünver, 2007. "Efficient Kidney Exchange: Coincidence of Wants in Markets with Compatibility-Based Preferences," American Economic Review, American Economic Association, vol. 97(3), pages 828-851, June.
    22. 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-1652, September.
    23. 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.
    24. Vulkan, Nir & Roth, Alvin E. & Neeman, Zvika (ed.), 2015. "The Handbook of Market Design," OUP Catalogue, Oxford University Press, number 9780198743774.
    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.
    26. Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May.
    27. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721.
    28. Avinatan Hassidim & Assaf Romm & Ran I. Shorrer, 2016. ""Strategic" Behavior in a Strategy-Proof Environment," Working Paper 413411, Harvard University OpenScholar.
    29. Paul Klemperer, 2004. "Auctions: Theory and Practice," Online economics textbooks, SUNY-Oswego, Department of Economics, number auction1.
    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


    Cited by:

    1. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    2. Shengwu Li, 2017. "Ethics and market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 705-720.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
    2. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    3. Yan Chen & Peter Cramton & John A. List & Axel Ockenfels, 2021. "Market Design, Human Behavior, and Management," Management Science, INFORMS, vol. 67(9), pages 5317-5348, September.
    4. Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-2271, August.
    5. Alvin E. Roth, 2009. "What Have We Learned from Market Design?," Innovation Policy and the Economy, University of Chicago Press, vol. 9(1), pages 79-112.
    6. 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.
    7. Eduardo M Azevedo & Eric Budish, 2019. "Strategy-proofness in the Large," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 86(1), pages 81-116.
    8. Pablo Guillen & Róbert F. Veszteg, 2021. "Strategy-proofness in experimental matching markets," Experimental Economics, Springer;Economic Science Association, vol. 24(2), pages 650-668, June.
    9. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    10. Chen, Yan & Jiang, Ming & Kesten, Onur & Robin, Stéphane & Zhu, Min, 2018. "Matching in the large: An experimental study," Games and Economic Behavior, Elsevier, vol. 110(C), pages 295-317.
    11. Kyle Greenberg & Parag A. Pathak & Tayfun Sonmez, 2021. "Mechanism Design meets Priority Design: Redesigning the US Army's Branching Process," Papers 2106.06582, arXiv.org.
    12. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    13. Kyle Greenberg & Parag A. Pathak & Tayfun Sönmez, 2020. "Mechanism Design meets Priority Design: Redesigning the US Army’s Branching Process Through Market Design," Boston College Working Papers in Economics 1035, Boston College Department of Economics.
    14. Ortega, Josué, 2020. "Multi-unit assignment under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
    15. Zhu, Min, 2014. "College admissions in China: A mechanism design perspective," China Economic Review, Elsevier, vol. 30(C), pages 618-631.
    16. Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
    17. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    18. Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
    19. Axel Ockenfels, 2009. "Marktdesign und Experimentelle Wirtschaftsforschung," Perspektiven der Wirtschaftspolitik, Verein für Socialpolitik, vol. 10(s1), pages 31-53, May.
    20. Martin Bichler & Soeren Merting, 2021. "Randomized Scheduling Mechanisms: Assigning Course Seats in a Fair and Efficient Way," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3540-3559, October.

    More about this item

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • C9 - Mathematical and Quantitative Methods - - Design of Experiments
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:22448. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/nberrus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.