IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2302.04354.html
   My bibliography  Save this paper

Consider or Choose? The Role and Power of Consideration Sets

Author

Listed:
  • Yi-Chun Akchen
  • Dmitry Mitrofanov

Abstract

Consideration sets play a crucial role in discrete choice modeling, where customers are commonly assumed to go through a two-stage decision making process. Specifically, customers are assumed to form consideration sets in the first stage and then use a second-stage choice mechanism to pick the product with the highest utility from the consideration sets. Recent studies mostly aim to propose more powerful choice mechanisms based on advanced non-parametric models to improve prediction accuracy. In contrast, this paper takes a step back from exploring more complex second-stage choice mechanisms and instead focus on how effectively we can model customer choice relying only on the first-stage consideration set formation. To this end, we study a class of nonparametric choice models that is only specified by a distribution over consideration sets and has a bounded rationality interpretation. We denote it as the consideration set model. Intriguingly, we show that this class of choice models can be characterized by the axiom of symmetric demand cannibalization, which enables complete statistical identification. We further consider the model's downstream assortment planning as an application. We first present an exact description of the optimal assortment, proving that it is revenue-ordered based on the blocks defined by the consideration sets. Despite this compelling structure, we establish that the assortment optimization problem under this model is NP-hard even to approximate. This result shows that accounting for consideration sets in the model inevitably results in inapproximability in assortment planning, even though the consideration set model uses the simplest possible uniform second-stage choice mechanism. Finally, using a real-world dataset, we show the tremendous power of the first-stage consideration sets when modeling customers' decision-making processes.

Suggested Citation

  • Yi-Chun Akchen & Dmitry Mitrofanov, 2023. "Consider or Choose? The Role and Power of Consideration Sets," Papers 2302.04354, arXiv.org, revised Jun 2024.
  • Handle: RePEc:arx:papers:2302.04354
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2302.04354
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jörg Rieskamp & Jerome R. Busemeyer & Barbara A. Mellers, 2006. "Extending the Bounds of Rationality: Evidence and Theories of Preferential Choice," Journal of Economic Literature, American Economic Association, vol. 44(3), pages 631-661, September.
    2. Paola Manzini & Marco Mariotti, 2014. "Stochastic Choice and Consideration Sets," Econometrica, Econometric Society, vol. 82(3), pages 1153-1176, May.
    3. Hausman, Jerry & McFadden, Daniel, 1984. "Specification Tests for the Multinomial Logit Model," Econometrica, Econometric Society, vol. 52(5), pages 1219-1240, September.
    4. John R. Hauser, 1978. "Testing the Accuracy, Usefulness, and Significance of Probabilistic Choice Models: An Information-Theoretic Approach," Operations Research, INFORMS, vol. 26(3), pages 406-421, June.
    5. Robin M. Hogarth & Natalia Karelaia, 2005. "Simple Models for Multiattribute Choice with Many Alternatives: When It Does and Does Not Pay to Face Trade-offs with Binary Attributes," Management Science, INFORMS, vol. 51(12), pages 1860-1872, December.
    6. repec:cup:cbooks:9780521438834 is not listed on IDEAS
    7. repec:cup:cbooks:9780521747387 is not listed on IDEAS
    8. Garrett van Ryzin & Gustavo Vulcano, 2017. "Technical Note—An Expectation-Maximization Method to Estimate a Rank-Based Choice Model of Demand," Operations Research, INFORMS, vol. 65(2), pages 396-407, April.
    9. Jose Blanchet & Guillermo Gallego & Vineet Goyal, 2016. "A Markov Chain Approximation to Choice Modeling," Operations Research, INFORMS, vol. 64(4), pages 886-905, August.
    10. Paat Rusmevichientong & David Shmoys & Chaoxu Tong & Huseyin Topaloglu, 2014. "Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters," Production and Operations Management, Production and Operations Management Society, vol. 23(11), pages 2023-2039, November.
    11. Richard L. Brady & John Rehbeck, 2016. "Menu‐Dependent Stochastic Feasibility," Econometrica, Econometric Society, vol. 84, pages 1203-1223, May.
    12. Shashi Mittal & Andreas S. Schulz, 2013. "A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One," Operations Research, INFORMS, vol. 61(2), pages 386-397, April.
    13. Barbera, Salvador & Pattanaik, Prasanta K, 1986. "Falmagne and the Rationalizability of Stochastic Choices in Terms of Random Orderings," Econometrica, Econometric Society, vol. 54(3), pages 707-715, May.
    14. repec:cup:cbooks:9780521766555 is not listed on IDEAS
    15. Timothy J. Gilbride & Greg M. Allenby, 2004. "A Choice Model with Conjunctive, Disjunctive, and Compensatory Screening Rules," Marketing Science, INFORMS, vol. 23(3), pages 391-406, October.
    16. Itai Sher & Jeremy T. Fox & Kyoo il Kim & Patrick Bajari, 2011. "Partial Identification of Heterogeneity in Preference Orderings Over Discrete Choices," NBER Working Papers 17346, National Bureau of Economic Research, Inc.
    17. A. Gürhan Kök & Marshall L. Fisher, 2007. "Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application," Operations Research, INFORMS, vol. 55(6), pages 1001-1021, December.
    18. Hauser, John R & Wernerfelt, Birger, 1990. "An Evaluation Cost Model of Consideration Sets," Journal of Consumer Research, Journal of Consumer Research Inc., vol. 16(4), pages 393-408, March.
    19. Swait, Joffre & Ben-Akiva, Moshe, 1987. "Incorporating random constraints in discrete models of choice set generation," Transportation Research Part B: Methodological, Elsevier, vol. 21(2), pages 91-102, April.
    20. Vinit Kumar Mishra & Karthik Natarajan & Dhanesh Padmanabhan & Chung-Piaw Teo & Xiaobo Li, 2014. "On Theoretical and Empirical Aspects of Marginal Distribution Choice Models," Management Science, INFORMS, vol. 60(6), pages 1511-1531, June.
    21. Dimitris Bertsimas & Velibor V. Mišić, 2019. "Exact First-Choice Product Line Optimization," Operations Research, INFORMS, vol. 67(3), pages 651-670, May.
    Full references (including those not matched with items on IDEAS)

    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. Hauser, John R., 2014. "Consideration-set heuristics," Journal of Business Research, Elsevier, vol. 67(8), pages 1688-1699.
    2. Ali Aouad & Vivek Farias & Retsef Levi, 2021. "Assortment Optimization Under Consider-Then-Choose Choice Models," Management Science, INFORMS, vol. 67(6), pages 3368-3386, June.
    3. Flores, Alvaro & Berbeglia, Gerardo & Van Hentenryck, Pascal, 2019. "Assortment optimization under the Sequential Multinomial Logit Model," European Journal of Operational Research, Elsevier, vol. 273(3), pages 1052-1064.
    4. Ali Aouad & Danny Segev, 2021. "Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences," Management Science, INFORMS, vol. 67(6), pages 3519-3550, June.
    5. Meng Qi & Ho‐Yin Mak & Zuo‐Jun Max Shen, 2020. "Data‐driven research in retail operations—A review," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 595-616, December.
    6. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
    7. Srikanth Jagabathula & Paat Rusmevichientong, 2017. "Nonparametric Joint Assortment and Price Choice Model," Management Science, INFORMS, vol. 63(9), pages 3128-3145, September.
    8. Alice Paul & Jacob Feldman & James Mario Davis, 2018. "Assortment Optimization and Pricing Under a Nonparametric Tree Choice Model," Manufacturing & Service Operations Management, INFORMS, vol. 20(3), pages 550-565, July.
    9. Crawford, Gregory S. & Griffith, Rachel & Iaria, Alessandro, 2021. "A survey of preference estimation with unobserved choice set heterogeneity," Journal of Econometrics, Elsevier, vol. 222(1), pages 4-43.
    10. Helmers, Christian & Krishnan, Pramila & Patnam, Manasa, 2019. "Attention and saliency on the internet: Evidence from an online recommendation system," Journal of Economic Behavior & Organization, Elsevier, vol. 161(C), pages 216-242.
    11. Sanjay Dominik Jena & Andrea Lodi & Claudio Sole, 2021. "On the estimation of discrete choice models to capture irrational customer behaviors," Papers 2109.03882, arXiv.org.
    12. Antoine Désir & Vineet Goyal & Danny Segev & Chun Ye, 2020. "Constrained Assortment Optimization Under the Markov Chain–based Choice Model," Management Science, INFORMS, vol. 66(2), pages 698-721, February.
    13. Carlos Alós-Ferrer & Ernst Fehr & Nick Netzer, 2021. "Time Will Tell: Recovering Preferences When Choices Are Noisy," Journal of Political Economy, University of Chicago Press, vol. 129(6), pages 1828-1877.
    14. Nan Liu & Yuhang Ma & Huseyin Topaloglu, 2020. "Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 835-853, July.
    15. Matias D. Cattaneo & Xinwei Ma & Yusufcan Masatlioglu & Elchin Suleymanov, 2020. "A Random Attention Model," Journal of Political Economy, University of Chicago Press, vol. 128(7), pages 2796-2836.
    16. Jacob Feldman & Alice Paul & Huseyin Topaloglu, 2019. "Technical Note—Assortment Optimization with Small Consideration Sets," Operations Research, INFORMS, vol. 67(5), pages 1283-1299, September.
    17. Christina Schamp & Mark Heitmann & Robin Katzenstein, 2019. "Consideration of ethical attributes along the consumer decision-making journey," Journal of the Academy of Marketing Science, Springer, vol. 47(2), pages 328-348, March.
    18. Kovach, Matthew & Ülkü, Levent, 2020. "Satisficing with a variable threshold," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 67-76.
    19. Garrett van Ryzin & Gustavo Vulcano, 2015. "A Market Discovery Algorithm to Estimate a General Class of Nonparametric Choice Models," Management Science, INFORMS, vol. 61(2), pages 281-300, February.
    20. Heydari, Pedram, 2021. "Luce arbitrates: Stochastic resolution of inner conflicts," Games and Economic Behavior, Elsevier, vol. 126(C), pages 33-74.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:2302.04354. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.