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

Quantifying Lottery Choice Complexity

Author

Listed:
  • Benjamin Enke
  • Cassidy Shubatt

Abstract

We develop interpretable, quantitative indices of the objective and subjective complexity of lottery choice problems that can be computed for any standard dataset. These indices capture the predicted error rate in identifying the lottery with the highest expected value, where the predictions are computed as convex combinations of choice set features. The most important complexity feature in the indices is a measure of the excess dissimilarity of the cumulative distribution functions of the lotteries in the set. Using our complexity indices, we study behavioral responses to complexity out-of-sample across one million decisions in 11,000 unique experimental choice problems. Complexity makes choices substantially noisier, which can generate systematic biases in revealed preference measures such as spurious risk aversion. These effects are very large, to the degree that complexity explains a larger fraction of estimated choice errors than proximity to indifference. Accounting for complexity in structural estimations improves model fit substantially.

Suggested Citation

  • Benjamin Enke & Cassidy Shubatt, 2023. "Quantifying Lottery Choice Complexity," NBER Working Papers 31677, National Bureau of Economic Research, Inc.
    • Handle: RePEc:nbr:nberwo:31677
    Note: TWP
    as

    Download full text from publisher

    File URL: http://www.nber.org/papers/w31677.pdf
    Download Restriction: Access to the full text is generally limited to series subscribers, however if the top level domain of the client browser is in a developing country or transition economy free access is provided. More information about subscriptions and free access is available at http://www.nber.org/wwphelp.html. Free access is also available to older working papers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Benjamin Enke & Thomas Graeber & Ryan Oprea & Thomas W. Graeber, 2023. "Complexity and Hyperbolic Discounting," CESifo Working Paper Series 10861, CESifo.
    2. Jian-Qiao Zhu & Joshua C. Peterson & Benjamin Enke & Thomas L. Griffiths, 2024. "Capturing the Complexity of Human Strategic Decision-Making with Machine Learning," Papers 2408.07865, arXiv.org.
    3. Jian-Qiao Zhu & Joshua C. Peterson & Benjamin Enke & Thomas L. Griffiths, 2024. "Capturing the Complexity of Human Strategic Decision-Making with Machine Learning," CESifo Working Paper Series 11296, CESifo.
    4. Cassidy Shubatt & Jeffrey Yang, 2024. "Tradeoffs and Comparison Complexity," Papers 2401.17578, arXiv.org, revised Oct 2024.

    More about this item

    JEL classification:

    • D03 - Microeconomics - - General - - - Behavioral Microeconomics: Underlying Principles

    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:31677. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.