|
||||
|
||||
Models of Sequential Evaluation in Best-Worst Choice TasksTatiana DyachenkoOhio State University (OSU) - Fisher College of Business Rebecca Walker NaylorOhio State University (OSU) - Department of Marketing and Logistics Greg M. AllenbyOhio State University (OSU) - Department of Marketing and Logistics March 27, 2013 Fisher College of Business Working Paper No. 2072496 Abstract: We examine the nature of best-worst data for modeling consumer preferences and predicting their choices. We show that, contrary to the assumption of widely used models, the best and worst responses do not originate from the same data-generating process. We propose a sequential evaluation model and show that later choices have systematically larger coefficients as compared to earlier choices. We also find the presence of an elicitation effect that leads to larger coefficients when respondents are asked to select the worst alternative, meaning that respondents are surer about what they like least than what they like most. Finally, we investigate global inference retrieval in choice tasks, which can be represented by the central limit theorem and normally distributed errors, versus episodic retrieval represented by extreme value errors. We find that both specifications of the error term are plausible and advise to use the proposed sequential logit model for practical reasons. We apply our model to data from a national survey investigating the concerns associated with hair care. We find that accounting for the sequential evaluation in the best-worst tasks and the presence of the scaling effects leads to different managerial implications compared to the results from currently used models.
Number of Pages in PDF File: 71 Keywords: Bayesian estimation, psychological models, choice models JEL Classification: C11, C25, M31 working papers seriesDate posted: June 2, 2012 ; Last revised: March 29, 2013Suggested CitationContact Information
|
|
|||||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo6 in 0.594 seconds