Heuristics and optimal solutions to the breadth-depth dilemma

dc.contributor.authorMoreno Bote, Rubén
dc.contributor.authorRamírez Ruiz, Jorge
dc.contributor.authorDrugowitsch, Jan
dc.contributor.authorHayden, Benjamin Y.
dc.date.accessioned2020-11-06T08:14:08Z
dc.date.available2020-11-06T08:14:08Z
dc.date.issued2020
dc.description.abstractIn multialternative risky choice, we are often faced with the opportunity to allocate our limited information-gathering capacity between several options before receiving feedback. In such cases, we face a natural trade-off between breadth—spreading our capacity across many options—and depth—gaining more information about a smaller number of options. Despite its broad relevance to daily life, including in many naturalistic foraging situations, the optimal strategy in the breadth–depth trade-off has not been delineated. Here, we formalize the breadth–depth dilemma through a finite-sample capacity model. We find that, if capacity is small (∼10 samples), it is optimal to draw one sample per alternative, favoring breadth. However, for larger capacities, a sharp transition is observed, and it becomes best to deeply sample a very small fraction of alternatives, which roughly decreases with the square root of capacity. Thus, ignoring most options, even when capacity is large enough to shallowly sample all of them, is a signature of optimal behavior. Our results also provide a rich casuistic for metareasoning in multialternative decisions with bounded capacity using close-to-optimal heuristics.en
dc.description.sponsorshipThis work is supported by the HHMI (Grant 55008742), Ministry of Economic Affairs and Digital Transformation (Spain) (Grant BFU2017-85936-P), and Catalan Institution for Research and Advanced Studies–Academia (2016) to R.M.-B.; by NIH (Grant DA037229) to B.Y.H.; and by a scholar award from the James S. McDonnell Foundation (Grant 220020462) to J.D.
dc.format.mimetypeapplication/pdf
dc.identifier.citationMoreno-Bote R, Ramírez-Ruiz J, Drugowitsch J, Hayden BY. Heuristics and optimal solutions to the breadth-depth dilemma. Proc Natl Acad Sci U S A. 2020 Aug 18;117(33):19799-808. DOI: 10.1073/pnas.2004929117
dc.identifier.doihttp://dx.doi.org/10.1073/pnas.2004929117
dc.identifier.issn0027-8424
dc.identifier.urihttp://hdl.handle.net/10230/45668
dc.language.isoeng
dc.publisherNational Academy of Sciences
dc.relation.ispartofProceedings of the National Academy of Sciences of the United States of America. 2020 Aug 18;117(33):19799-808
dc.relation.projectIDinfo:eu-repo/grantAgreement/ES/2PE/BFU2017-85936-P
dc.rights© 2020 the Author(s). Published by PNAS. This open access article is distributed under Creative Commons Attribution-NonCommercial-NoDerivatives License 4.0 (CC BY-NC-ND). https://creativecommons.org/licenses/by-nc-nd/4.0/
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subject.keywordDecision makingen
dc.subject.keywordRisky choiceen
dc.subject.keywordBounded rationalityen
dc.subject.keywordBreadth–depth dilemmaen
dc.subject.keywordMetareasoningen
dc.titleHeuristics and optimal solutions to the breadth-depth dilemmaen
dc.typeinfo:eu-repo/semantics/article
dc.type.versioninfo:eu-repo/semantics/publishedVersion

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
moreno_pnasusa_heuri.pdf
Size:
893.47 KB
Format:
Adobe Portable Document Format

License

Rights