Ranked-choice conjoint experiments produce AMCE estimates equivalent to forced-choice designs but with 12-55% smaller standard errors depending on the number of ranked profiles, recommending four profiles per vignette.
Learning Preferences from Conjoint Data: A Structural Deep Learning Approach
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Conjoint experiments randomize multidimensional profiles, offering a powerful design for recovering structural preference parameters -- including marginal rates of substitution, willingness to pay, and the distribution of preferences across a population. Yet the dominant approach in political science has focused on nonparametric causal estimands that do not leverage this potential. We propose a structural approach that embeds a deep neural network within a random utility logit model, allowing preference parameters to vary as a fully flexible function of respondent characteristics. The neural network addresses the concern that a parametric specification may not capture the true data generating process, while double/debiased machine learning provides valid inference on average preference parameters. We apply our method to three prominent conjoint studies and find rich preference heterogeneity masked by reduced-form averages: a near-zero gender effect coexists with 83% preferring female candidates, opposition to undemocratic behavior is near-universal but varies sharply in intensity, and progressive tax preferences cut across every partisan subgroup.
fields
stat.ME 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Ranked-choice conjoint experiments
Ranked-choice conjoint experiments produce AMCE estimates equivalent to forced-choice designs but with 12-55% smaller standard errors depending on the number of ranked profiles, recommending four profiles per vignette.