Abstract

Choice set designs that include a constant or no-choice option have increased efficiency, better mimic consumer choices, and allow one to model changes in market size. However, when the no-choice option is selected no information is obtained on the relative attractiveness of the available alternatives. One potential solution to this problem is to use a dual response format in which respondents first choose among a set of available alternatives in a forced-choice task and then choose among the available alternatives and a no-choice option. This paper uses a simulation to demonstrate and confirm the possible gains in efficiency of dual response over traditional choice-based conjoint tasks when there are different proportions choosing the no-choice option. Next, two choice-based conjoint analysis studies find little systematic violation of IIA with the addition/deletion of a no-choice option. Further analysis supports the hypothesis that selection of the no-choice option is more closely related to choice set attractiveness than to decision difficulty. Finally, validation evidence is presented. Our findings show that researchers can employ the dual response approach, taking advantages of the increased power of estimation, without concern for systematically biasing the resulting parameter estimates. Hence, we argue this is a valuable approach when there is the possibility of a large number of no-choices and preference heterogeneity.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.