Compensatory versus noncompensatory models for predicting consumer preferences
Standard preference models in consumer research assume that people weigh and add all attributes of the available options to derive a decision, while there is growing evidence for the use of simplifying heuristics. Recently, a greedoid algorithm has been developed (Yee, Dahan, Hauser and Orlin, 2007;...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Society for Judgment and Decision Making
2009-04-01
|
Series: | Judgment and Decision Making |
Subjects: | |
Online Access: | http://journal.sjdm.org/81008/jdm81008.pdf |
id |
doaj-32567cc327604660bceb0c46ad2b35c3 |
---|---|
record_format |
Article |
spelling |
doaj-32567cc327604660bceb0c46ad2b35c32021-05-02T09:20:16ZengSociety for Judgment and Decision MakingJudgment and Decision Making1930-29752009-04-0143200213Compensatory versus noncompensatory models for predicting consumer preferencesAnja DieckmannKatrin DippoldHolger DietrichStandard preference models in consumer research assume that people weigh and add all attributes of the available options to derive a decision, while there is growing evidence for the use of simplifying heuristics. Recently, a greedoid algorithm has been developed (Yee, Dahan, Hauser and Orlin, 2007; Kohli and Jedidi, 2007) to model lexicographic heuristics from preference data. We compare predictive accuracies of the greedoid approach and standard conjoint analysis in an online study with a rating and a ranking task. The lexicographic model derived from the greedoid algorithm was better at predicting ranking compared to rating data, but overall, it achieved lower predictive accuracy for hold-out data than the compensatory model estimated by conjoint analysis. However, a considerable minority of participants was better predicted by lexicographic strategies. We conclude that the new algorithm will not replace standard tools for analyzing preferences, but can boost the study of situational and individual differences in preferential choice processes. http://journal.sjdm.org/81008/jdm81008.pdfConjoint analysisgreedoid algorithmchoice modelinglexicographic heuristicsnoncompensatory heuristicsconsumer choiceconsumer preferences. |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Anja Dieckmann Katrin Dippold Holger Dietrich |
spellingShingle |
Anja Dieckmann Katrin Dippold Holger Dietrich Compensatory versus noncompensatory models for predicting consumer preferences Judgment and Decision Making Conjoint analysis greedoid algorithm choice modeling lexicographic heuristics noncompensatory heuristics consumer choice consumer preferences. |
author_facet |
Anja Dieckmann Katrin Dippold Holger Dietrich |
author_sort |
Anja Dieckmann |
title |
Compensatory versus noncompensatory models for predicting consumer preferences |
title_short |
Compensatory versus noncompensatory models for predicting consumer preferences |
title_full |
Compensatory versus noncompensatory models for predicting consumer preferences |
title_fullStr |
Compensatory versus noncompensatory models for predicting consumer preferences |
title_full_unstemmed |
Compensatory versus noncompensatory models for predicting consumer preferences |
title_sort |
compensatory versus noncompensatory models for predicting consumer preferences |
publisher |
Society for Judgment and Decision Making |
series |
Judgment and Decision Making |
issn |
1930-2975 |
publishDate |
2009-04-01 |
description |
Standard preference models in consumer research assume that people weigh and add all attributes of the available options to derive a decision, while there is growing evidence for the use of simplifying heuristics. Recently, a greedoid algorithm has been developed (Yee, Dahan, Hauser and Orlin, 2007; Kohli and Jedidi, 2007) to model lexicographic heuristics from preference data. We compare predictive accuracies of the greedoid approach and standard conjoint analysis in an online study with a rating and a ranking task. The lexicographic model derived from the greedoid algorithm was better at predicting ranking compared to rating data, but overall, it achieved lower predictive accuracy for hold-out data than the compensatory model estimated by conjoint analysis. However, a considerable minority of participants was better predicted by lexicographic strategies. We conclude that the new algorithm will not replace standard tools for analyzing preferences, but can boost the study of situational and individual differences in preferential choice processes. |
topic |
Conjoint analysis greedoid algorithm choice modeling lexicographic heuristics noncompensatory heuristics consumer choice consumer preferences. |
url |
http://journal.sjdm.org/81008/jdm81008.pdf |
work_keys_str_mv |
AT anjadieckmann compensatoryversusnoncompensatorymodelsforpredictingconsumerpreferences AT katrindippold compensatoryversusnoncompensatorymodelsforpredictingconsumerpreferences AT holgerdietrich compensatoryversusnoncompensatorymodelsforpredictingconsumerpreferences |
_version_ |
1721493409647034368 |