`Divide-and-choose' in list-based decision problems
From MaRDI portal
Publication:2629322
DOI10.1007/S11238-015-9522-ZzbMATH Open1378.91062OpenAlexW2218596607MaRDI QIDQ2629322FDOQ2629322
Authors: Dinko Dimitrov, Saptarshi Mukherjee, Nozomu Muto
Publication date: 6 July 2016
Published in: Theory and Decision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11238-015-9522-z
Recommendations
Cites Work
- Cognitive constraints, contraction consistency, and the satisficing criterion
- A million answers to twenty questions: choosing by checklist
- Path Independence, Rationality, and Social Choice
- Search, choice, and revealed preference
- (A,f): Choice with Frames1
- Choice by iterative search
- On the multi-attribute stopping problem with general value functions
- On Optimal Satisficing: How Simple Policies Can Achieve Excellent Results
- Choice by sequential procedures
- A theory of iterative choice in lists
- Optimal Search for the Best Alternative
- A model of boundedly rational ``neuro~agents
- List-rationalizable choice
Cited In (4)
This page was built for publication: `Divide-and-choose' in list-based decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629322)