Fast Polyhedral Adaptive Conjoint Estimation
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...
Main Authors: | Olivier, Toubia, Duncan, Simester, John, Hauser |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/3800 |
Similar Items
-
Application and Test of Web-based Adaptive Polyhedral Conjoint Analysis
by: Dahan, Ely, et al.
Published: (2003) -
Fast Polyhedral Adaptive Conjoint Estimation
by: Toubia, Olivier, et al.
Published: (2003) -
Fast Polyhedral Adaptive Conjoint Estimation
by: Toubia, Olivier, et al.
Published: (2003) -
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
by: Wang, Xiaoning, et al.
Published: (2018) -
Polyhedral Methods for Adaptive Choice-Based Conjoint Analysis
by: Toubia, Olivier, et al.
Published: (2003)