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

The Limits of Personalization in Assortment Optimization

Author

Listed:
  • Guillermo Gallego
  • Gerardo Berbeglia

Abstract

To study the limits of personalization, we introduce the notion of a clairvoyant firm that can read the mind of consumers and sell them the highest revenue product that they are willing to buy. We show how to compute the expected revenue of the clairvoyant firm for a class of rational discrete choice models, and develop prophet-type inequalities that provide performance guarantees for the expected revenue of the traditional assortment optimization firm (a TAOP firm) relative to the clairvoyant firm, and therefore to any effort to personalize assortments. In particular, we show that the expected revenue of the clairvoyant firm cannot exceed twice the expected revenue of the TAOP for the RCS model, the MNL, the GAM and the Nested Logit Model. On the other hand, there are random utility models for which personalized assortments can earn up to $n$ times more than a TAOP firm, where $n$ is the number of products. Our numerical studies indicate that when the mean utilities of the products are heterogeneous among consumer types, and the variance of the utilities is small, firms can gain substantial benefits from personalized assortments. We support these observations, and others, with theoretical findings. While the consumers surplus can potentially be larger under personalized assortments, clairvoyant firms with pricing power can extract all surplus, and earn arbitrarily more than traditional firms that optimize over prices but do not personalize them. For the price-aware MNL, however, a clairvoyant firm can earn at most $e$ times more than a traditional firm.

Suggested Citation

  • Guillermo Gallego & Gerardo Berbeglia, 2021. "The Limits of Personalization in Assortment Optimization," Papers 2109.14861, arXiv.org, revised Jun 2024.
  • Handle: RePEc:arx:papers:2109.14861
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Paola Manzini & Marco Mariotti, 2014. "Stochastic Choice and Consideration Sets," Econometrica, Econometric Society, vol. 82(3), pages 1153-1176, May.
    2. 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.
    3. Fernando Bernstein & Sajad Modaresi & Denis Sauré, 2019. "A Dynamic Clustering Approach to Data-Driven Assortment Personalization," Management Science, INFORMS, vol. 67(5), pages 2095-2115, May.
    4. Negin Golrezaei & Hamid Nazerzadeh & Paat Rusmevichientong, 2014. "Real-Time Optimization of Personalized Assortments," Management Science, INFORMS, vol. 60(6), pages 1532-1551, June.
    5. Carri W. Chan & Vivek F. Farias, 2009. "Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 333-350, May.
    6. Huseyin Topaloglu, 2009. "Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 637-649, June.
    7. Kelly L. Haws & William O. Bearden, 2006. "Dynamic Pricing and Consumer Fairness Perceptions," Journal of Consumer Research, Journal of Consumer Research Inc., vol. 33(3), pages 304-311, October.
    8. Jose Blanchet & Guillermo Gallego & Vineet Goyal, 2016. "A Markov Chain Approximation to Choice Modeling," Operations Research, INFORMS, vol. 64(4), pages 886-905, August.
    9. Guillermo Gallego & Huseyin Topaloglu, 2019. "Revenue Management and Pricing Analytics," International Series in Operations Research and Management Science, Springer, number 978-1-4939-9606-3, March.
    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. Guillermo Gallego & Anran Li & Van-Anh Truong & Xinshang Wang, 2020. "Approximation Algorithms for Product Framing and Pricing," Operations Research, INFORMS, vol. 68(1), pages 134-160, January.
    12. 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.
    13. 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.
    14. 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.
    15. Yanzhe (murray) Lei & Sentao Miao & Ruslan Momot, 2020. "Privacy-Preserving Personalized Revenue Management," Working Papers hal-02968517, HAL.
    16. 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.
    17. Nathan Kallus & Madeleine Udell, 2020. "Dynamic Assortment Personalization in High Dimensions," Operations Research, INFORMS, vol. 68(4), pages 1020-1037, July.
    18. Shota Ichihashi, 2020. "Online Privacy and Information Disclosure by Consumers," American Economic Review, American Economic Association, vol. 110(2), pages 569-595, February.
    19. 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.
    20. Avi Goldfarb & Catherine Tucker, 2012. "Shifts in Privacy Concerns," American Economic Review, American Economic Association, vol. 102(3), pages 349-353, May.
    21. Fernando Bernstein & A. Gürhan Kök & Lei Xie, 2015. "Dynamic Assortment Customization with Limited Inventories," Manufacturing & Service Operations Management, INFORMS, vol. 17(4), pages 538-553, October.
    22. Gallego, Guillermo & Li, Anran & Truong, Van-Anh & Wang, Xinshang, 2020. "Approximation algorithms for product framing and pricing," LSE Research Online Documents on Economics 101983, London School of Economics and Political Science, LSE Library.
    23. Guillermo Gallego & Gerardo Berbeglia, 2021. "Bounds and Heuristics for Multi-Product Personalized Pricing," Papers 2102.03038, arXiv.org, revised Feb 2021.
    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. Julia Heger & Robert Klein, 2024. "Assortment optimization: a systematic literature review," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(4), pages 1099-1161, December.
    2. 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.
    3. Ali Aouad & Daniela Saban, 2023. "Online Assortment Optimization for Two-Sided Matching Platforms," Management Science, INFORMS, vol. 69(4), pages 2069-2087, April.
    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. Kris Johnson Ferreira & Joel Goh, 2021. "Assortment Rotation and the Value of Concealment," Management Science, INFORMS, vol. 67(3), pages 1489-1507, March.
    6. 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.
    7. 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.
    8. Nathan Kallus & Madeleine Udell, 2020. "Dynamic Assortment Personalization in High Dimensions," Operations Research, INFORMS, vol. 68(4), pages 1020-1037, July.
    9. 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.
    10. Hense, Jonas & Hübner, Alexander, 2022. "Assortment optimization in omni-channel retailing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 124-140.
    11. Xiao-Yue Gong & Vineet Goyal & Garud N. Iyengar & David Simchi-Levi & Rajan Udwani & Shuangyu Wang, 2022. "Online Assortment Optimization with Reusable Resources," Management Science, INFORMS, vol. 68(7), pages 4772-4785, July.
    12. Muzaffer Buyruk & Ertan Güner, 2022. "Personalization in airline revenue management: an overview and future outlook," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 21(2), pages 129-139, April.
    13. Ilan Lobel, 2021. "Revenue Management and the Rise of the Algorithmic Economy," Management Science, INFORMS, vol. 67(9), pages 5389-5398, September.
    14. Çö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).
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. Wang, Mengmeng & Zhang, Xun & Li, Xiaolong, 2023. "Multiple-purchase choice model: estimation and optimization," International Journal of Production Economics, Elsevier, vol. 265(C).

    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:2109.14861. 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.