Greedoid-Based Noncompensatory Inference
AbstractGreedoid languages provide a basis to infer best-fitting noncompensatory decision rules from full-rank conjoint data or partial-rank data such as consider-then-rank, consider-only, or choice data. Potential decision rules include elimination by aspects, acceptance by aspects, lexicographic by features, and a mixed-rule lexicographic by aspects (LBA) that nests the other rules. We provide a dynamic program that makes estimation practical for a moderately large numbers of aspects. We test greedoid methods with applications to SmartPhones (339 respondents, both full-rank and consider-then-rank data) and computers (201 respondents from Lenk et al. 1996). We compare LBA to two compensatory benchmarks: hierarchical Bayes ranked logit (HBRL) and LINMAP. For each benchmark, we consider an unconstrained model and a model constrained so that aspects are truly compensatory. For both data sets, LBA predicts (new task) holdouts at least as well as compensatory methods for the majority of the respondents. LBA's relative predictive ability increases (ranks and choices) if the task is full rank rather than consider then rank. LBA's relative predictive ability does not change if (1) we allow respondents to presort profiles, or (2) we increase the number of profiles in a consider-then-rank task from 16 to 32. We examine trade-offs between effort and accuracy for the type of task and the number of profiles.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Marketing Science.
Volume (Year): 26 (2007)
Issue (Month): 4 (07-08)
lexicography; noncompensatory decision rules; choice heuristics; optimization methods in marketing; conjoint analysis; product development; consideration sets;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Berg, Nathan & Gigerenzer, Gerd, 2010. "As-if behavioral economics: Neoclassical economics in disguise?," MPRA Paper 26586, University Library of Munich, Germany.
- Mandler, Michael & Manzini, Paola & Mariotti, Marco, 2012.
"A million answers to twenty questions: Choosing by checklist,"
Journal of Economic Theory,
Elsevier, vol. 147(1), pages 71-92.
- Mandler, Michael & Manzini, Paola & Mariotti, Marco, 2008. "A Million Answers to Twenty Questions: Choosing by Checklist," IZA Discussion Papers 3377, Institute for the Study of Labor (IZA).
- Michael Mandler & Paola Manzini & Marco Mariotti, 2008. "A Million Answers to Twenty Questions: Choosing by Checklist," Working Papers 622, Queen Mary, University of London, School of Economics and Finance.
- Bernhard Weiss & Uwe Dulleck & Franz Hackl & Rudolf Winter-Ebmer, 2008.
"Buying Online: Sequential Decision Making by Shopbot Visitors,"
Economics working papers
2008-10, Department of Economics, Johannes Kepler University Linz, Austria.
- Dulleck, Uwe & Hackl, Franz & Weiss, Bernhard & Winter-Ebmer, Rudolf, 2008. "Buying Online: Sequential Decision Making by Shopbot Visitors," CEPR Discussion Papers 6939, C.E.P.R. Discussion Papers.
- Dulleck, Uwe & Hackl, Franz & Weiss, Bernhard & Winter-Ebmer, Rudolf, 2008. "Buying Online: Sequential Decision Making by Shopbot Visitors," Economics Series 225, Institute for Advanced Studies.
- Uwe Dulleck & Franz Hackl & Bernhard Weiss & Rudolf Winter-Ebmer, 2008. "Buying Online: Sequential Decision Making by Shopbot Visitors," NCER Working Paper Series 31, National Centre for Econometric Research.
- John Hauser, 2011. "A marketing science perspective on recognition-based heuristics (and the fast-and-frugal paradigm)," Judgment and Decision Making, Society for Judgment and Decision Making, vol. 6(5), pages 396-408, July.
- Paola Manzini & Marco Mariotti, 2009.
"Consumer choice and revealed bounded rationality,"
Springer, vol. 41(3), pages 379-392, December.
- Simon P. Anderson & Régis Renault, 2013.
"The Advertising Mix for a Search Good,"
INFORMS, vol. 59(1), pages 69-83, April.
- Renault, Régis & Anderson, Simon P., 2013. "The Advertising Mix for a Search Good," Economics Papers from University Paris Dauphine 123456789/12407, Paris Dauphine University.
- Anderson, Simon P & Renault, Régis, 2012. "The advertising mix for a search good," CEPR Discussion Papers 8756, C.E.P.R. Discussion Papers.
- Nicolas Houy, 2011. "Common characterizations of the untrapped set and the top cycle," Theory and Decision, Springer, vol. 70(4), pages 501-509, April.
- Jella Pfeiffer & Michael Scholz, 2013. "A Low-Effort Recommendation System with High Accuracy," Business & Information Systems Engineering, Springer, vol. 5(6), pages 397-408, December.
- Hauser, John R., 2014. "Consideration-set heuristics," Journal of Business Research, Elsevier, vol. 67(8), pages 1688-1699.
- Schlereth, Christian & Eckert, Christine & Schaaf, René & Skiera, Bernd, 2014. "Measurement of preferences with self-explicated approaches: A classification and merge of trade-off- and non-trade-off-based evaluation types," European Journal of Operational Research, Elsevier, vol. 238(1), pages 185-198.
- Berg, Nathan, 2010. "Success from Satisficing and Imitation: Entrepreneurs’ Location Choice and Implications of Heuristics for Local Economic Development," MPRA Paper 26594, University Library of Munich, Germany.
- Oded Netzer & Olivier Toubia & Eric Bradlow & Ely Dahan & Theodoros Evgeniou & Fred Feinberg & Eleanor Feit & Sam Hui & Joseph Johnson & John Liechty & James Orlin & Vithala Rao, 2008. "Beyond conjoint analysis: Advances in preference measurement," Marketing Letters, Springer, vol. 19(3), pages 337-354, December.
- Berg, Nathan, 2014. "Success from satisficing and imitation: Entrepreneurs' location choice and implications of heuristics for local economic development," Journal of Business Research, Elsevier, vol. 67(8), pages 1700-1709.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.