.png){kind=icon}
返回
Polyhedral methods for adaptive choice-based conjoint analysis
.png){kind=icon}
OA
AI
DOI：10.1509/jmkr.41.1.116.25082.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The authors propose and test a new polyhedral choice-based conjoint analysis question-design method that adapts each respondent's choice sets on the basis of previous answers by that respondent. Polyhedral interior-point algorithms design questions that quickly reduce the sets of partworths that are consistent with the respondent's choices. To identify domains in which individual adaptation is promising (and domains in which it is not), the authors evaluate the performance of polyhedral choice-based conjoint analysis methods with Monte Carlo experiments. They vary magnitude (response accuracy), respondent heterogeneity, estimation method, and question-design method in a 4 x 23 experiment. The estimation methods are hierarchical Bayes and analytic center. The latter is a new individual-level estimation procedure that is a by-product of polyhedral question design. The benchmarks for individual adaptation are random designs, orthogonal designs, and aggregate customization. The simulations suggest that polyhedral question design does well in many domains, particularly those in which heterogeneity and partworth magnitudes are relatively large. The authors test feasibility, test an important design criterion (choice balance), and obtain empirical data on convergence by describing an application to the design of executive education programs in which 354 Web-based respondents answered stated-choice tasks with four service profiles each.
Keyword:
HETEROGENEITY
MODELS
CUSTOMIZATION
PREDICTION
ALGORITHM
DESIGNS
DEMAND
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
5
论文数:
2.6K
被引数:
2.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
Improving parameter estimates and model prediction by aggregate customization in choice experiments
PREAI
分享收藏分享收藏
查看更多内容