A million answers to twenty questions: choosing by checklist
From MaRDI portal
Publication:665450
DOI10.1016/j.jet.2011.11.012zbMath1258.91051OpenAlexW3121653343MaRDI QIDQ665450
Paola Manzini, Marco Mariotti, Michael Mandler
Publication date: 5 March 2012
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jet.2011.11.012
Decision theory (91B06) Utility theory (91B16) Individual preferences (91B08) Rationality and learning in game theory (91A26)
Related Items (20)
When more is less: limited consideration ⋮ Characterizing lexicographic preferences ⋮ Unstable interactions in customers' decision making: an experimental proof ⋮ Partial knowledge restrictions on the two-stage threshold model of choice ⋮ `Divide-and-choose' in list-based decision problems ⋮ A game theoretic model of searching for a unique good from a large set of offers ⋮ Context dependent beliefs ⋮ Random assignments on sequentially dichotomous domains ⋮ On rational choice and the representation of decision problems ⋮ State dependent choice ⋮ Choice in ordered-tree-based decision problems ⋮ Rational choices: an ecological approach ⋮ A theory of reference point formation ⋮ Lexicographic preference representation: intrinsic length of linear orders on infinite sets ⋮ Salience and limited attention ⋮ Hazard rate, stochastic choice and consideration sets ⋮ Rational agents are the quickest ⋮ The computational complexity of rationalizing behavior ⋮ The lexicographic method in preference theory ⋮ Progressive stopping heuristics that excel in individual and competitive sequential search
Cites Work
- Choice by sequential procedures
- Naïve heuristics for paired comparisons: some results on their relative accuracy
- Rational agents are the quickest
- Lexicographic compositions of multiple criteria for decision making
- Choice by lexicographic semiorders
- An Optimal Search Procedure
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- A Method for the Construction of Minimum-Redundancy Codes
- Revealed Preference Theory
- Why Are Certain Properties of Binary Relations Relatively More Common in Natural Language?
- Sur une propriété des ensembles ordonnés
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A million answers to twenty questions: choosing by checklist