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

Technical Note—Assortment Optimization with Small Consideration Sets

Author

Listed:
  • Jacob Feldman

    (Olin Business School, Washington University, St. Louis, Missouri 63108)

  • Alice Paul

    (Data Science Initiative, Brown University, Providence, Rhode Island 02912)

  • Huseyin Topaloglu

    (School of Operations Research and Information Engineering, Cornell Tech, New York, New York 11011)

Abstract

We study a customer choice model that captures purchasing behavior when there is a limit on the number of times that a customer will substitute among the offered products. Under this model, we assume each customer is characterized by a ranked preference list of products and, upon arrival, will purchase the highest ranking offered product. Because we restrict ourselves to settings in which customers consider a limited number of products, we assume that these rankings contain at most k products. We call this model the k -product nonparametric choice model. We focus on the assortment optimization problem under this choice model. In this problem, the retailer wants to find the revenue-maximizing set of products to offer when the buying process of each customer is governed by the k -product nonparametric choice model. First, we show that the assortment problem is strongly NP-hard even for k = 2. Motivated by this result, we develop a linear programming–based randomized rounding algorithm that gives the best known approximation guarantee. We tighten the approximation guarantee further when each preference list contains at most two products and consider the case in which there is a limit on the number of products that can be offered to the customers.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:67:y:2019:i:5:p:1283-1299
    DOI: opre.2018.1803
    as

    Download full text from publisher

    File URL: https://doi.org/opre.2018.1803
    Download Restriction: no
    File URL: https://libkey.io/opre.2018.1803?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. Kalyan Talluri, 2014. "New Formulations for Choice Network Revenue Management," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 401-413, May.
    2. Dorothee Honhon & Sreelata Jonnalagedda & Xiajun Amy Pan, 2012. "Optimal Algorithms for Assortment Selection Under Ranking-Based Consumer Choice Models," Manufacturing & Service Operations Management, INFORMS, vol. 14(2), pages 279-289, April.
    3. 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.
    4. 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.
    5. Guillermo Gallego & Huseyin Topaloglu, 2014. "Constrained Assortment Optimization for the Nested Logit Model," Management Science, INFORMS, vol. 60(10), pages 2583-2601, October.
    6. Jose Blanchet & Guillermo Gallego & Vineet Goyal, 2016. "A Markov Chain Approximation to Choice Modeling," Operations Research, INFORMS, vol. 64(4), pages 886-905, August.
    7. 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.
    8. Kalyan Talluri & Garrett van Ryzin, 2004. "Revenue Management Under a General Discrete Choice Model of Consumer Behavior," Management Science, INFORMS, vol. 50(1), pages 15-33, January.
    9. James M. Davis & Guillermo Gallego & Huseyin Topaloglu, 2014. "Assortment Optimization Under Variants of the Nested Logit Model," Operations Research, INFORMS, vol. 62(2), pages 250-273, April.
    10. 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.
    11. Paat Rusmevichientong & Zuo-Jun Max Shen & David B. Shmoys, 2010. "Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint," Operations Research, INFORMS, vol. 58(6), pages 1666-1680, December.
    12. Abel P. Jeuland, 1979. "Brand Choice Inertia as One Aspect of the Notion of Brand Loyalty," Management Science, INFORMS, vol. 25(7), pages 671-682, July.
    13. Jacob B. Feldman & Huseyin Topaloglu, 2015. "Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model," Operations Research, INFORMS, vol. 63(4), pages 812-822, August.
    14. Guang Li & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "The d -Level Nested Logit Model: Assortment and Price Optimization Problems," Operations Research, INFORMS, vol. 63(2), pages 325-342, April.
    15. Gilles Laurent & Eric Lapersonne & Jean-Jacques Le Goff, 1995. "Consideration sets of size one: An empirical investigation of automobile purchases," Post-Print hal-00458463, HAL.
    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. Çömez-Dolgan, Nagihan & Fescioglu-Unver, Nilgun & Cephe, Ecem & Şen, Alper, 2021. "Capacitated strategic assortment planning under explicit demand substitution," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1120-1138.
    2. Will Ma, 2023. "When Is Assortment Optimization Optimal?," Management Science, INFORMS, vol. 69(4), pages 2088-2105, April.
    3. Yi-Chun Chen & Velibor V. Mišić, 2022. "Decision Forest: A Nonparametric Approach to Modeling Irrational Choice," Management Science, INFORMS, vol. 68(10), pages 7090-7111, October.
    4. Velibor V. Mišić & Georgia Perakis, 2020. "Data Analytics in Operations Management: A Review," Manufacturing & Service Operations Management, INFORMS, vol. 22(1), pages 158-169, January.
    5. Çömez-Dolgan, Nagihan & Dağ, Hilal & Fescioglu-Unver, Nilgun & Şen, Alper, 2023. "Multi-plant manufacturing assortment planning in the presence of transshipments," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1033-1050.
    6. 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.
    7. Qingwei Jin & Mengyan Zhu & Yi Yang & Lin Liu, 2022. "Consumer search with anticipated regret," Production and Operations Management, Production and Operations Management Society, vol. 31(8), pages 3337-3351, August.
    8. Markus Leitner & Andrea Lodi & Roberto Roberti & Claudio Sole, 2024. "An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 479-494, March.
    9. Escallon-Barrios, Mariana & Noham, Reut & Smilowitz, Karen, 2024. "Dual mode scheduling in volunteer management," Socio-Economic Planning Sciences, Elsevier, vol. 92(C).

    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. Kameng Nip & Zhenbo Wang & Zizhuo Wang, 2021. "Assortment Optimization under a Single Transition Choice Model," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2122-2142, July.
    2. 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.
    3. 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.
    4. 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.
    5. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    6. 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.
    7. Çömez-Dolgan, Nagihan & Moussawi-Haidar, Lama & Jaber, Mohamad Y. & Cephe, Ecem, 2022. "Capacitated assortment planning of a multi-location system under transshipments," International Journal of Production Economics, Elsevier, vol. 251(C).
    8. Çömez-Dolgan, Nagihan & Dağ, Hilal & Fescioglu-Unver, Nilgun & Şen, Alper, 2023. "Multi-plant manufacturing assortment planning in the presence of transshipments," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1033-1050.
    9. Shipra Agrawal & Vashist Avadhanula & Vineet Goyal & Assaf Zeevi, 2019. "MNL-Bandit: A Dynamic Learning Approach to Assortment Selection," Operations Research, INFORMS, vol. 67(5), pages 1453-1485, September.
    10. Wang, Mengmeng & Zhang, Xun & Li, Xiaolong, 2023. "Multiple-purchase choice model: estimation and optimization," International Journal of Production Economics, Elsevier, vol. 265(C).
    11. Dimitris Bertsimas & Velibor V. Mišić, 2019. "Exact First-Choice Product Line Optimization," Operations Research, INFORMS, vol. 67(3), pages 651-670, May.
    12. 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.
    13. Rui Chen & Hai Jiang, 2020. "Assortment optimization with position effects under the nested logit model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(1), pages 21-33, February.
    14. Hekimoğlu, Mustafa & Sevim, Ismail & Aksezer, Çağlar & Durmuş, İpek, 2019. "Assortment optimization with log-linear demand: Application at a Turkish grocery store," Journal of Retailing and Consumer Services, Elsevier, vol. 50(C), pages 199-214.
    15. 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.
    16. Heng Zhang & Paat Rusmevichientong & Huseyin Topaloglu, 2020. "Assortment Optimization Under the Paired Combinatorial Logit Model," Operations Research, INFORMS, vol. 68(3), pages 741-761, May.
    17. Mehrani, Saharnaz & Sefair, Jorge A., 2022. "Robust assortment optimization under sequential product unavailability," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1027-1043.
    18. Ruxian Wang & Zizhuo Wang, 2017. "Consumer Choice Models with Endogenous Network Effects," Management Science, INFORMS, vol. 63(11), pages 3944-3960, November.
    19. Rui Chen & Hai Jiang, 2020. "Capacitated assortment and price optimization under the nested logit model," Journal of Global Optimization, Springer, vol. 77(4), pages 895-918, August.
    20. Mika Sumida & Guillermo Gallego & Paat Rusmevichientong & Huseyin Topaloglu & James Davis, 2021. "Revenue-Utility Tradeoff in Assortment Optimization Under the Multinomial Logit Model with Totally Unimodular Constraints," Management Science, INFORMS, vol. 67(5), pages 2845-2869, May.

    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:5:p:1283-1299. 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.