IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v67y2019i2p315-338.html
   My bibliography  Save this article

Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis

Author

Listed:
  • Denis Sauré

    (University of Chile, 8370456 Santiago, Chile;)

  • Juan Pablo Vielma

    (MIT Sloan School of Management, Cambridge, Massachusetts 02142)

Abstract

Questionnaires for adaptive choice-based conjoint analysis aim at minimizing some measure of the uncertainty associated with estimates of preference parameters (e.g., partworths). Bayesian approaches to conjoint analysis quantify this uncertainty with a multivariate distribution that is updated after the respondent answers. Unfortunately, this update often requires multidimensional integration, which effectively reduces the adaptive selection of questions to impractical enumeration. An alternative approach is the polyhedral method for adaptive conjoint analysis, which quantifies the uncertainty through a (convex) polyhedron. The approach has a simple geometric interpretation and allows for quick credibility-region updates and effective optimization-based heuristics for adaptive question selection. However, its performance deteriorates with high response-error rates. Available adaptations to this method do not preserve all of the geometric simplicity and interpretability of the original approach. We show how, by using normal approximations to posterior distributions, one can include response error in an approximate Bayesian approach that is as intuitive as the polyhedral approach and allows the use of effective optimization-based techniques for adaptive question selection. This ellipsoidal approach extends the effectiveness of the polyhedral approach to the high response-error setting and provides a simple geometric interpretation (from which the method derives its name) of Bayesian approaches. Our results precisely quantify the relationship between the most popular efficiency criterion and heuristic guidelines promoted in extant work. We illustrate the superiority of the ellipsoidal method through extensive numerical experiments.

Suggested Citation

  • Denis Sauré & Juan Pablo Vielma, 2019. "Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis," Operations Research, INFORMS, vol. 67(2), pages 315-338, March.
  • Handle: RePEc:inm:oropre:v:67:y:2019:i:2:p:315-338
    DOI: 10.1287/opre.2018.1790
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/opre.2018.1790
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2018.1790?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Bliemer, Michiel C.J. & Rose, John M., 2010. "Construction of experimental designs for mixed logit models allowing for correlation across choice observations," Transportation Research Part B: Methodological, Elsevier, vol. 44(6), pages 720-734, July.
    2. Green, Paul E & Srinivasan, V, 1978. "Conjoint Analysis in Consumer Research: Issues and Outlook," Journal of Consumer Research, Journal of Consumer Research Inc., vol. 5(2), pages 103-123, Se.
    3. Juan Pablo Vielma & Shabbir Ahmed & George Nemhauser, 2010. "Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions," Operations Research, INFORMS, vol. 58(2), pages 303-315, April.
    4. Yu, Jie & Goos, Peter & Vandebroek, Martina, 2011. "Individually adapted sequential Bayesian conjoint-choice designs in the presence of consumer heterogeneity," International Journal of Research in Marketing, Elsevier, vol. 28(4), pages 378-388.
    5. Arora, Neeraj & Huber, Joel, 2001. "Improving Parameter Estimates and Model Prediction by Aggregate Customization in Choice Experiments," Journal of Consumer Research, Journal of Consumer Research Inc., vol. 28(2), pages 273-283, September.
    6. Daria Dzyabura & John R. Hauser, 2011. "Active Machine Learning for Consideration Heuristics," Marketing Science, INFORMS, vol. 30(5), pages 801-819, September.
    7. Jeff Brazell & Christopher Diener & Ekaterina Karniouchina & William Moore & Válerie Séverin & Pierre-Francois Uldry, 2006. "The no-choice option and dual response choice designs," Marketing Letters, Springer, vol. 17(4), pages 255-268, December.
    8. Olivier Toubia & Eric Johnson & Theodoros Evgeniou & Philippe Delquié, 2013. "Dynamic Experiments for Estimating Preferences: An Adaptive Method of Eliciting Time and Risk Parameters," Management Science, INFORMS, vol. 59(3), pages 613-640, June.
    9. Greg Allenby & Jeff Brazell & John Howell & Peter Rossi, 2014. "Economic valuation of product features," Quantitative Marketing and Economics (QME), Springer, vol. 12(4), pages 421-456, December.
    10. Louviere,Jordan J. & Hensher,David A. & Swait,Joffre D. With contributions by-Name:Adamowicz,Wiktor, 2000. "Stated Choice Methods," Cambridge Books, Cambridge University Press, number 9780521788304.
    11. Miles Lubin & Iain Dunning, 2015. "Computing in Operations Research Using Julia," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 238-248, May.
    12. Jie Yu & Peter Goos & Martina Vandebroek, 2009. "Efficient Conjoint Choice Designs in the Presence of Respondent Heterogeneity," Marketing Science, INFORMS, vol. 28(1), pages 122-135, 01-02.
    13. John R. Hauser & Olivier Toubia, 2005. "The Impact of Utility Balance and Endogeneity in Conjoint Analysis," Marketing Science, INFORMS, vol. 24(3), pages 498-507, August.
    14. Kessels, Roselinde & Jones, Bradley & Goos, Peter & Vandebroek, Martina, 2009. "An Efficient Algorithm for Constructing Bayesian Optimal Choice Designs," Journal of Business & Economic Statistics, American Statistical Association, vol. 27(2), pages 279-291.
    15. Olivier Toubia & John Hauser & Rosanna Garcia, 2007. "Probabilistic Polyhedral Methods for Adaptive Choice-Based Conjoint Analysis: Theory and Application," Marketing Science, INFORMS, vol. 26(5), pages 596-610, 09-10.
    16. Crabbe, Marjolein & Akinc, Deniz & Vandebroek, Martina, 2014. "Fast algorithms to generate individualized designs for the mixed logit choice model," Transportation Research Part B: Methodological, Elsevier, vol. 60(C), pages 1-15.
    17. Dongling Huang & Lan Luo, 2016. "Consumer Preference Elicitation of Complex Products Using Fuzzy Support Vector Machine Active Learning," Marketing Science, INFORMS, vol. 35(3), pages 445-464, May.
    18. Qing Liu & Yihui (Elina) Tang, 2015. "Construction of Heterogeneous Conjoint Choice Designs: A New Approach," Marketing Science, INFORMS, vol. 34(3), pages 346-366, May.
    19. Dimitris Bertsimas & Allison O'Hair, 2013. "Learning Preferences Under Noise and Loss Aversion: An Optimization Approach," Operations Research, INFORMS, vol. 61(5), pages 1190-1199, October.
    20. Dapeng Cui & David Curry, 2005. "Prediction in Marketing Using the Support Vector Machine," Marketing Science, INFORMS, vol. 24(4), pages 595-615, January.
    21. Theodoros Evgeniou & Constantinos Boussios & Giorgos Zacharia, 2005. "Generalized Robust Conjoint Estimation," Marketing Science, INFORMS, vol. 24(3), pages 415-429, May.
    22. Theodoros Evgeniou & Massimiliano Pontil & Olivier Toubia, 2007. "A Convex Optimization Approach to Modeling Consumer Heterogeneity in Conjoint Estimation," Marketing Science, INFORMS, vol. 26(6), pages 805-818, 11-12.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Junpei Komiyama & Shunya Noda, 2021. "Deviation-Based Learning: Training Recommender Systems Using Informed User Choice," Papers 2109.09816, arXiv.org, revised Aug 2022.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dongling Huang & Lan Luo, 2016. "Consumer Preference Elicitation of Complex Products Using Fuzzy Support Vector Machine Active Learning," Marketing Science, INFORMS, vol. 35(3), pages 445-464, May.
    2. James Agarwal & Wayne DeSarbo & Naresh K. Malhotra & Vithala Rao, 2015. "An Interdisciplinary Review of Research in Conjoint Analysis: Recent Developments and Directions for Future Research," Customer Needs and Solutions, Springer;Institute for Sustainable Innovation and Growth (iSIG), vol. 2(1), pages 19-40, March.
    3. Maldonado, Sebastián & Montoya, Ricardo & Weber, Richard, 2015. "Advanced conjoint analysis using feature selection via support vector machines," European Journal of Operational Research, Elsevier, vol. 241(2), pages 564-574.
    4. Yu, Jie & Goos, Peter & Vandebroek, Martina, 2011. "Individually adapted sequential Bayesian conjoint-choice designs in the presence of consumer heterogeneity," International Journal of Research in Marketing, Elsevier, vol. 28(4), pages 378-388.
    5. Ma, Liye & Sun, Baohong, 2020. "Machine learning and AI in marketing – Connecting computing power to human insights," International Journal of Research in Marketing, Elsevier, vol. 37(3), pages 481-504.
    6. Gensler, Sonja & Hinz, Oliver & Skiera, Bernd & Theysohn, Sven, 2012. "Willingness-to-pay estimation with choice-based conjoint analysis: Addressing extreme response behavior with individually adapted designs," European Journal of Operational Research, Elsevier, vol. 219(2), pages 368-378.
    7. Frischknecht, Bart D. & Eckert, Christine & Geweke, John & Louviere, Jordan J., 2014. "A simple method for estimating preference parameters for individuals," International Journal of Research in Marketing, Elsevier, vol. 31(1), pages 35-48.
    8. Julio López & Sebastián Maldonado & Ricardo Montoya, 2017. "Simultaneous preference estimation and heterogeneity control for choice-based conjoint via support vector machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1323-1334, November.
    9. Nedka Dechkova Nikiforova & Rossella Berni & Jesús Fernando López‐Fidalgo, 2022. "Optimal approximate choice designs for a two‐step coffee choice, taste and choice again experiment," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 71(5), pages 1895-1917, November.
    10. Wang, Xin (Shane) & Ryoo, Jun Hyun (Joseph) & Bendle, Neil & Kopalle, Praveen K., 2021. "The role of machine learning analytics and metrics in retailing research," Journal of Retailing, Elsevier, vol. 97(4), pages 658-675.
    11. Hauser, John R., 2014. "Consideration-set heuristics," Journal of Business Research, Elsevier, vol. 67(8), pages 1688-1699.
    12. Olivier Toubia & John R. Hauser, 2007. "—On Managerially Efficient Experimental Designs," Marketing Science, INFORMS, vol. 26(6), pages 851-858, 11-12.
    13. Crabbe, M. & Vandebroek, M., 2012. "Improving the efficiency of individualized designs for the mixed logit choice model by including covariates," Computational Statistics & Data Analysis, Elsevier, vol. 56(6), pages 2059-2072.
    14. van Cranenburgh, Sander & Rose, John M. & Chorus, Caspar G., 2018. "On the robustness of efficient experimental designs towards the underlying decision rule," Transportation Research Part A: Policy and Practice, Elsevier, vol. 109(C), pages 50-64.
    15. Theodoros Evgeniou & Massimiliano Pontil & Olivier Toubia, 2007. "A Convex Optimization Approach to Modeling Consumer Heterogeneity in Conjoint Estimation," Marketing Science, INFORMS, vol. 26(6), pages 805-818, 11-12.
    16. Ghaderi, Mohammad & Kadziński, Miłosz, 2021. "Incorporating uncovered structural patterns in value functions construction," Omega, Elsevier, vol. 99(C).
    17. Vishva Danthurebandara & Jie Yu & Martina Vandebroek, 2015. "Designing choice experiments by optimizing the complexity level to individual abilities," Quantitative Marketing and Economics (QME), Springer, vol. 13(1), pages 1-26, March.
    18. Christian Schlereth & Bernd Skiera, 2017. "Two New Features in Discrete Choice Experiments to Improve Willingness-to-Pay Estimation That Result in SDR and SADR: Separated (Adaptive) Dual Response," Management Science, INFORMS, vol. 63(3), pages 829-842, March.
    19. Andreas Falke & Harald Hruschka, 2017. "A Monte Carlo study of design-generating algorithms for the latent class mixed logit model," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1035-1053, October.
    20. John Rose & Michiel Bliemer, 2013. "Sample size requirements for stated choice experiments," Transportation, Springer, vol. 40(5), pages 1021-1041, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:67:y:2019:i:2:p:315-338. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.