IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

Fast Polyhedral Adaptive Conjoint Estimation

  • Toubia, Olivier
  • Simester, Duncan
  • Hauser, John
  • Dahan, Ely

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.

If 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.

File URL: http://hdl.handle.net/1721.1/1811
Download Restriction: no

Paper provided by Massachusetts Institute of Technology (MIT), Sloan School of Management in its series Working papers with number 4171-01.

as
in new window

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

No references listed on IDEAS
You can help add them by filling out this form.

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:1811. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Zimmermann)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.