Why Do Simple Heuristics Perform Well in Choices with Binary Attributes?
From MaRDI portal
Publication:4691971
DOI10.1287/deca.2013.0281zbMath1398.91185OpenAlexW2110530315MaRDI QIDQ4691971
Publication date: 24 October 2018
Published in: Decision Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/deca.2013.0281
Related Items (4)
On the role of psychological heuristics in operational research; and a demonstration in military stability operations ⋮ A simple model for mixing intuition and analysis ⋮ Compatibility effects in the prescriptive application of psychological heuristics: inhibition, integration and selection ⋮ A Characterization of Lexicographic Preferences
Cites Work
- Unnamed Item
- Naïve heuristics for paired comparisons: some results on their relative accuracy
- How much information do we need?
- ``Take-the-best and other simple strategies: why and when they work ``well with binary cues
- Fast, frugal, and fit: simple heuristics for paired comparison
- Classifier technology and the illusion of progress
- Tight upper bounds for the expected loss of lexicographic heuristics in binary multi-attribute choice
- Simple Models for Multiattribute Choice with Many Alternatives: When It Does and Does Not Pay to Face Trade-offs with Binary Attributes
- Cumulative Dominance and Heuristic Performance in Binary Multiattribute Choice
This page was built for publication: Why Do Simple Heuristics Perform Well in Choices with Binary Attributes?