Web-based customer panels and web-based multimedia capabilities offer the potential to get information from customers rapidly and iteratively based on virtual product profiles. However, web-based respondents are impatient and wear out more quickly. At the same time, in commercial applications, conjoint analysis is being used to screen large numbers of product features. Both of these trends are leading to a demand for conjoint analysis methods that provide reasonable estimates with fewer questions in problems involving many parameters. In this paper we propose and test new adaptive conjoint analysis methods that attempt to reduce respondent burden while simultaneously improving accuracy. We draw on recent "interior-point" developments in mathematical programming which enable us to quickly select those questions that narrow the range of feasible partworths as fast as possible. We then use recent centrality concepts (the analytic center) to estimate partworths. These methods are efficient, run with no noticeable delay in web-based questionnaires, and have the potential to provide estimates of the partworths with fewer questions than extant methods. After introducing these "polyhedral algorithms" we implement one such algorithm and test it with Monte Carlo simulation against benchmarks such as efficient (fixed) designs and Adaptive Conjoint Analysis (ACA). While no method dominates in all situations, the polyhedral algorithm appears to hold significant potential when (a) profile comparisons are more accurate than the self-explicated importance measures used in ACA, (b) when respondent wear out is a concern, and (c) when the product development and marketing teams wish to screen many features quickly. We also test a hybrid method that combines polyhedral question selection with ACA estimation and show that it, too, has the potential to improve predictions in many contexts. The algorithm we test helps to illustrate how polyhedral methods can be combined effectively and synergistically with the wide variety of existing conjoint analysis methods. We close with suggestions on how polyhedral algorithms can be used in other preference measurement contexts (e.g., choice-based conjoint analysis) and other marketing problems.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper provided by Massachusetts Institute of Technology (MIT), Sloan School of Management in its series Working papers with number
4171-01.
Length: Date of creation: 03 Feb 2003 Date of revision: Handle: RePEc:mit:sloanp:1811
Contact details of provider: Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA Phone: 617-253-2659 Web page: http://mitsloan.mit.edu/ More information through EDIRC
Order Information: Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA
For technical questions regarding this item, or to correct its listing, contact: (Christian Zimmermann).
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)
Joel Steckel & Russell Winer & Randolph Bucklin & Benedict Dellaert & Xavier Drèze & Gerald Häubl & Sandy Jap & John Little & Tom Meyvis & Alan Montgomery & Arvind Rangaswamy, 2005.
"Choice in Interactive Environments,"
Marketing Letters,
Springer, vol. 16(3), pages 309-320, December.
[Downloadable!] (restricted)