IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v14y2016i1d10.1007_s10288-015-0302-y.html
   My bibliography  Save this article

Assortment optimization under a multinomial logit model with position bias and social influence

Author

Listed:
  • Andrés Abeliuk

    (The University of Melbourne and National ICT Australia)

  • Gerardo Berbeglia

    (The University of Melbourne and National ICT Australia)

  • Manuel Cebrian

    (The University of Melbourne and National ICT Australia)

  • Pascal Van Hentenryck

    (The University of Michigan)

Abstract

Motivated by applications in retail, online advertising, and cultural markets, this paper studies the problem of finding an optimal assortment and positioning of products subject to a capacity constraint in a setting where consumers preferences can be modeled as a discrete choice under a multinomial logit model that captures the intrinsic product appeal, position biases, and social influence. For the static problem, we prove that the optimal assortment and positioning can be found in polynomial time. This is despite the fact that adding a product to the assortment may increase the probability of selecting the no-choice option, a phenomenon not observed in almost all models studied in the literature. We then consider the dynamics of such a market, where consumers are influenced by the aggregate past purchases. In this dynamic setting, we provide a small example to show that the natural and often used policy known as popularity ranking, that ranks products in decreasing order of the number of purchases, can reduce the expected profit as times goes by. We then prove that a greedy policy that applies the static optimal assortment and positioning at each period, always benefits from the popularity signal and outperforms any policy where consumers cannot observe the number of past purchases (in expectation).

Suggested Citation

  • Andrés Abeliuk & Gerardo Berbeglia & Manuel Cebrian & Pascal Van Hentenryck, 2016. "Assortment optimization under a multinomial logit model with position bias and social influence," 4OR, Springer, vol. 14(1), pages 57-75, March.
  • Handle: RePEc:spr:aqjoor:v:14:y:2016:i:1:d:10.1007_s10288-015-0302-y
    DOI: 10.1007/s10288-015-0302-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-015-0302-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10288-015-0302-y?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Andrés Abeliuk & Gerardo Berbeglia & Manuel Cebrian & Pascal Van Hentenryck, 2015. "The Benefits of Social Influence in Optimized Cultural Markets," PLOS ONE, Public Library of Science, vol. 10(4), pages 1-20, April.
    2. Juan José Miranda Bront & Isabel Méndez-Díaz & Gustavo Vulcano, 2009. "A Column Generation Algorithm for Choice-Based Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 769-784, June.
    3. Catherine Tucker & Juanjuan Zhang, 2011. "How Does Popularity Information Affect Choices? A Field Experiment," Management Science, INFORMS, vol. 57(5), pages 828-842, May.
    4. 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.
    5. 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.
    6. Qian Liu & Garrett van Ryzin, 2008. "On the Choice-Based Linear Programming Model for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 10(2), pages 288-310, October.
    7. Coco Krumme & Manuel Cebrian & Galen Pickard & Sandy Pentland, 2012. "Quantifying Social Influence in an Online Cultural Market," PLOS ONE, Public Library of Science, vol. 7(5), pages 1-6, May.
    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. Fatemeh Nosrat & William L. Cooper & Zizhuo Wang, 2021. "Pricing for a product with network effects and mixed logit demand," Naval Research Logistics (NRL), John Wiley & Sons, vol. 68(2), pages 159-182, March.
    2. Mahsa Derakhshan & Negin Golrezaei & Vahideh Manshadi & Vahab Mirrokni, 2022. "Product Ranking on Online Platforms," Management Science, INFORMS, vol. 68(6), pages 4024-4041, 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. Dipankar Das, 2023. "A Model of Competitive Assortment Planning Algorithm," Papers 2307.09479, arXiv.org.
    5. Hense, Jonas & Hübner, Alexander, 2022. "Assortment optimization in omni-channel retailing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 124-140.
    6. 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.
    7. Guillermo Gallego & Gerardo Berbeglia, 2021. "Bounds, Heuristics, and Prophet Inequalities for Assortment Optimization," Papers 2109.14861, arXiv.org, revised Oct 2023.
    8. Uzma Mushtaque & Jennifer A. Pazour, 2020. "Random Utility Models with Cardinality Context Effects for Online Subscription Service Platforms," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 19(4), pages 276-290, August.
    9. Yinbo Feng & Ming Hu, 2017. "Blockbuster or Niche? Competitive Strategy under Network Effects," Working Papers 17-13, NET Institute.
    10. Schäfer, Fabian & Hense, Jonas & Hübner, Alexander, 2023. "An analytical assessment of demand effects in omni-channel assortment planning," Omega, Elsevier, vol. 115(C).
    11. Shaojie Tang & Jing Yuan, 2021. "Cascade Submodular Maximization: Question Selection and Sequencing in Online Personality Quiz," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2143-2161, July.
    12. 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.
    13. Kris J. Ferreira & Sunanda Parthasarathy & Shreyas Sekar, 2022. "Learning to Rank an Assortment of Products," Management Science, INFORMS, vol. 68(3), pages 1828-1848, March.
    14. 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.
    15. Berbeglia, Franco & Berbeglia, Gerardo & Van Hentenryck, Pascal, 2021. "Market segmentation in online platforms," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1025-1041.
    16. Page, Kenneth & Pérez, Juan & Telha, Claudio & García-Echalar, Andrés & López-Ospina, Héctor, 2021. "Optimal bundle composition in competition for continuous attributes," European Journal of Operational Research, Elsevier, vol. 293(3), pages 1168-1187.

    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. 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.
    2. 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.
    3. W. Zachary Rayfield & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 335-357, May.
    4. 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.
    5. Chan, Rebecca & Li, Zhaolin & Matsypura, Dmytro, 2020. "Assortment optimisation problem: A distribution-free approach," Omega, Elsevier, vol. 95(C).
    6. Jacob B. Feldman & Huseyin Topaloglu, 2017. "Revenue Management Under the Markov Chain Choice Model," Operations Research, INFORMS, vol. 65(5), pages 1322-1342, October.
    7. 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.
    8. Guillermo Gallego & Huseyin Topaloglu, 2014. "Constrained Assortment Optimization for the Nested Logit Model," Management Science, INFORMS, vol. 60(10), pages 2583-2601, October.
    9. Xi Chen & Chao Shi & Yining Wang & Yuan Zhou, 2021. "Dynamic Assortment Planning Under Nested Logit Models," Production and Operations Management, Production and Operations Management Society, vol. 30(1), pages 85-102, January.
    10. 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.
    11. 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.
    12. 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.
    13. Barbier, Thibault & Anjos, Miguel F. & Cirinei, Fabien & Savard, Gilles, 2020. "Product-closing approximation for ranking-based choice network revenue management," European Journal of Operational Research, Elsevier, vol. 286(3), pages 1002-1017.
    14. Wuyang Yuan & Lei Nie & Xin Wu & Huiling Fu, 2018. "A dynamic bid price approach for the seat inventory control problem in railway networks with consideration of passenger transfer," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-23, August.
    15. 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.
    16. Dimitris Bertsimas & Velibor V. Mišić, 2019. "Exact First-Choice Product Line Optimization," Operations Research, INFORMS, vol. 67(3), pages 651-670, May.
    17. Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "Dynamic Assortment Optimization for Reusable Products with Random Usage Durations," Management Science, INFORMS, vol. 66(7), pages 2820-2844, July.
    18. Sumit Kunnumkal & Victor Martínez-de-Albéniz, 2019. "Tractable Approximations for Assortment Planning with Product Costs," Operations Research, INFORMS, vol. 67(2), pages 436-452, March.
    19. 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.
    20. Ali Aouad & Jacob Feldman & Danny Segev, 2023. "The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model?," Management Science, INFORMS, vol. 69(5), pages 2814-2832, 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:spr:aqjoor:v:14:y:2016:i:1:d:10.1007_s10288-015-0302-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.