Disjunctions of Conjunctions, Cognitive Simplicity, and Consideration Sets
The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
The authors test methods, based on cognitively simple decision rules, that predict which products consumers select for their consideration sets. Drawing on qualitative research, the authors propose disjunctions-of-conjunctions (DOC) decision rules that generalize well-studied decision models, such as disjunctive, conjunctive, lexicographic, and subset conjunctive rules. They propose two machine-learning methods to estimate cognitively simple DOC rules. They observe consumers' consideration sets for global positioning systems for both calibration and validation data. They compare the proposed methods with both machine-learning and hierarchical Bayes methods, each based on five extant compensatory and noncompensatory rules. For the validation data, the cognitively simple DOC-based methods predict better than the ten benchmark methods on an information theoretic measure and on hit rates. The results are robust with respect to format by which consideration is measured, sample, and presentation of profiles. The article closes with an illustration of how DOC-based rules can affect managerial decisions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
A BEHAVIORAL MODEL OF RATIONAL CHOICE
Simon, H. A. (1955) · The Quarterly Journal of Economics · doi:10.2307/1884852 · Cited by 15,877
A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection
Kohavi, R. (1995) · Zenodo · doi:10.5281/zenodo.19712698 · Cited by 10,909
Reasoning the fast and frugal way: Models of bounded rationality.
Gigerenzer, G., & Goldstein, D. G. (1996) · Psychological Review · doi:10.1037/0033-295x.103.4.650 · Cited by 3,504
Payne, J. W., Bettman, J. R., & Johnson, E. J. (1993) · doi:10.1017/cbo9781139173933 · Cited by 3,487
Elimination by aspects: A theory of choice
Tversky, A. (1972) · Psychological Review · doi:10.1037/h0032955 · Cited by 3,365
The robust beauty of improper linear models in decision making.
Dawes, R. M. (1979) · American Psychologist · doi:10.1037/0003-066x.34.7.571 · Cited by 1,966
Adaptive strategy selection in decision making.
Payne, J. W., Bettman, J. R., & Johnson, E. J. (1988) · Journal of Experimental Psychology: Learning, Memory, and Cognition · doi:10.1037/0278-7393.14.3.534 · Cited by 1,955
Linear Model Selection by Cross-validation
Shao, J. (1993) · Journal of the American Statistical Association · doi:10.1080/01621459.1993.10476299 · Cited by 1,790
Reliability of Nominal Data Based on Qualitative Judgments
Perreault, W. D., & Leigh, L. E. (1989) · Journal of Marketing Research · doi:10.2307/3172601 · Cited by 1,575
On a measure of the information provided by an experiment
Lindley, D. V. (1956) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728069 · Cited by 1,509
Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation
Kearns, M., & Ron, D. (1999) · Neural Computation · doi:10.1162/089976699300016304 · Cited by 407
Cited by
Machine learning and AI in marketing–Connecting computing power to human insights
Ma, L., & Sun, B. (2020) · International Journal of Research in Marketing · doi:10.1016/j.ijresmar.2020.04.005 · Cited by 602
Hauser, J. R. (2014) · Journal of Business Research · doi:10.1016/j.jbusres.2014.02.015 · Cited by 256
Self-citationActive Machine Learning for Consideration Heuristics
Dzyabura, D., & Hauser, J. R. (2011) · Marketing Science · doi:10.1287/mksc.1110.0660 · Cited by 92
Self-citationSatisficing: Integrating Two Traditions
Artinger, F. M., Gigerenzer, G., & Jacobs, P. (2022) · Journal of Economic Literature · doi:10.1257/jel.20201396 · Cited by 90
Assessing the Use of Agent-Based Models for Tobacco Regulation
Committee on the Assessment of Agent-Based Models to Inform Tobacco Product Regulation, Board on Population Health and Public Health Practice, & Institute of Medicine (2015) · doi:10.17226/19018 · Cited by 83
Metadata
- Authors
- Hauser, J. R., Toubia, O., Evgeniou, T., Befurt, R., & Dzyabura, D.
- Venue
- Journal of Marketing Research
- Publisher
- SAGE Publications
- Published
- 2010-06
- Volume
- 47
- Issue
- 3
- Pages
- 485-496
- ISSN
- 0022-2437 (ISSN-L)
- 1547-7193
- OpenAlex
- W2167317197
- Cited by
- 152
- References
- 12
- FWCI
- 6.92
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.