Naïve heuristics for paired comparisons: some results on their relative accuracy

DOI10.1016/j.jmp.2006.06.001zbMath1151.91420OpenAlexW2070354923WikidataQ56767611 ScholiaQ56767611MaRDI QIDQ856650

Konstantinos V. Katsikopoulos, Laura Martignon

Publication date: 7 December 2006

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmp.2006.06.001

zbMATH Keywords

social choicelexicographicpaired comparisoncondorcet jury theoremscueminimalistNaïve BayesTake The Besttallying

Mathematics Subject Classification ID

Social choice (91B14)

Related Items (13)

Applications of the bias-variance decomposition to human forecasting ⋮ Book review of: G. Schurz, Hume's problem solved. The optimality of meta-induction ⋮ Modelling phenomena and dynamic logic of phenomena ⋮ A geometric analysis of when fixed weighting schemes will outperform ordinary least squares ⋮ Qualitative heuristics for balancing the pros and cons ⋮ A million answers to twenty questions: choosing by checklist ⋮ One-reason decision-making: modeling violations of expected utility theory ⋮ Nonparametric item response theory axioms and properties under nonlinearity and their exemplification with knowledge space theory ⋮ Compatibility effects in the prescriptive application of psychological heuristics: inhibition, integration and selection ⋮ Why Do Simple Heuristics Perform Well in Choices with Binary Attributes? ⋮ Categorization with limited resources: A family of simple heuristics ⋮ The lexicographic method in preference theory ⋮ Meta-inductive prediction based on attractivity weighting: mathematical and empirical performance evaluation

Cites Work

• On the optimality of the simple Bayesian classifier under zero-one loss
• Bayesian network classifiers
• Fast, frugal, and fit: simple heuristics for paired comparison
• A nonasymptotic Condorcet jury theorem
• Ignoring information in binary choice with continuous variables: When is less ``more?
• The computational complexity of probabilistic inference using Bayesian belief networks
• 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
• Optimal Decision Rules in Uncertain Dichotomous Choice Situations

This page was built for publication: Naïve heuristics for paired comparisons: some results on their relative accuracy