Why Do Simple Heuristics Perform Well in Choices with Binary Attributes? (Q4691971): Difference between revisions

@@ Property / DOI @@
-.1287/deca.2013.0281
@@ Property / DOI: 10.1287/deca.2013.0281 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1287/deca.2013.0281
+Normal rank
@@ Property / OpenAlex ID @@
+W2110530315
@@ Property / OpenAlex ID: W2110530315 / rank @@
+Normal rank
@@ Property / cites work @@
+Cumulative Dominance and Heuristic Performance in Binary Multiattribute Choice
+Normal rank
@@ Property / cites work @@
+Tight upper bounds for the expected loss of lexicographic heuristics in binary multi-attribute choice
+Normal rank
@@ Property / cites work @@
+Classifier technology and the illusion of progress
+Normal rank
@@ Property / cites work @@
+Simple Models for Multiattribute Choice with Many Alternatives: When It Does and Does Not Pay to Face Trade-offs with Binary Attributes
+Normal rank
@@ Property / cites work @@
+``Take-the-best'' and other simple strategies: why and when they work ``well'' with binary cues
+Normal rank
@@ Property / cites work @@
+Naïve heuristics for paired comparisons: some results on their relative accuracy
+Normal rank
@@ Property / cites work @@
+Q4180077
@@ Property / cites work: Q4180077 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast, frugal, and fit: simple heuristics for paired comparison
+Normal rank
@@ Property / cites work @@
+How much information do we need?
@@ Property / cites work: How much information do we need? / rank @@
+Normal rank
@@ Property / DOI @@
+.1287/DECA.2013.0281
@@ Property / DOI: 10.1287/DECA.2013.0281 / rank @@
+Normal rank