Advanced Search

Fast Polyhedral Adaptive Conjoint Estimation

Research and Teaching Output of the MIT Community

Show simple item record Olivier, Toubia Duncan, Simester John, Hauser 2003-12-09T17:41:06Z 2003-12-09T17:41:06Z 2002-02
dc.description.abstract We propose and test a new adaptive conjoint analysis method that draws on recent polyhedral “interior-point” developments in mathematical programming. The method is designed to offer accurate estimates after relatively few questions in problems involving many parameters. Each respondent’s ques-tions are adapted based upon prior answers by that respondent. The method requires computer support but can operate in both Internet and off-line environments with no noticeable delay between questions. We use Monte Carlo simulations to compare the performance of the method against a broad array of relevant benchmarks. While no method dominates in all situations, polyhedral algorithms appear to hold significant potential when (a) metric profile comparisons are more accurate than the self-explicated importance measures used in benchmark methods, (b) when respondent wear out is a concern, and (c) when product development and/or marketing teams wish to screen many features quickly. We also test hybrid methods that combine polyhedral algorithms with existing conjoint analysis methods. We close with suggestions on how polyhedral methods can be used to address other marketing problems. en
dc.description.sponsorship Sloan School of Management and the Center for Innovation in Product Development at MIT en
dc.format.extent 1287038 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.subject adaptive conjoint analysis en
dc.subject polyhedral en
dc.subject interior-point en
dc.subject mathematical programming en
dc.subject accurate estimates en
dc.subject Monte Carlo simulations en
dc.subject polyhedral algorithms en
dc.title Fast Polyhedral Adaptive Conjoint Estimation en
dc.type Working Paper en

Files in this item

Name Size Format Description
VC_FastPace.pdf 1.227Mb PDF

This item appears in the following Collection(s)

Show simple item record