IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v25y2023i2p448-467.html

Detecting Customer Trends for Optimal Promotion Targeting

Author

Listed:
  • Lennart Baardman

    (Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109)

  • Setareh Borjian Boroujeni

    (Oracle Retail Global Business Unit (RGBU), Burlington, Massachusetts 01803)

  • Tamar Cohen-Hillel

    (Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • Kiran Panchamgam

    (Oracle Retail Global Business Unit (RGBU), Burlington, Massachusetts 01803)

  • Georgia Perakis

    (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

Abstract

Problem definition : Retailers have become increasingly interested in personalizing their products and services such as promotions. For this, we need new personalized demand models. Unfortunately, social data are not available to many retailers because of cost and privacy issues. Thus, we focus on the problem of detecting customer relationships from transactional data and using them to target promotions to the right customers. Academic/practical relevance : From an academic point of view, this paper solves the novel problem of jointly detecting customer trends and using them for optimal promotion targeting. Notably, we estimate the causal customer-to-customer trend effect solely from transactional data and target promotions for multiple items and time periods. In practice, we provide a new tool for Oracle Retail clients that personalizes promotions. Methodology : We develop a novel customer trend demand model distinguishing between a base purchase probability, capturing factors such as price and seasonality, and a customer trend probability, capturing customer-to-customer trend effects. The estimation procedure is based on regularized bounded variables least squares and instrumental variable methods. The resulting customer trend estimates feed into the dynamic promotion targeting optimization problem, formulated as a nonlinear mixed-integer optimization model. Though it is nondeterministic polynomial-time hard, we propose a greedy algorithm. Results : We prove that our customer-to-customer trend estimates are statistically consistent and that the greedy optimization algorithm is provably good. Having access to Oracle Retail fashion client data, we show that our demand model reduces the weighted-mean absolute percentage error by 11% on average. Also, we provide evidence of the causality of our estimates. Finally, we demonstrate that the optimal policy increases profits by 3%–11%. Managerial implications : The demand model with customer trend and the optimization model for targeted promotions form a decision-support tool for promotion planning. Next to general planning, it also helps to find important customers and target them to generate additional sales.

Suggested Citation

  • Lennart Baardman & Setareh Borjian Boroujeni & Tamar Cohen-Hillel & Kiran Panchamgam & Georgia Perakis, 2023. "Detecting Customer Trends for Optimal Promotion Targeting," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 448-467, March.
  • Handle: RePEc:inm:ormsom:v:25:y:2023:i:2:p:448-467
    DOI: 10.1287/msom.2020.0893
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2020.0893
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2020.0893?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. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Bertsimas, Dimitris & Copenhaver, Martin S., 2018. "Characterization of the equivalence of robustification and regularization in linear and matrix regression," European Journal of Operational Research, Elsevier, vol. 270(3), pages 931-942.
    3. Bramoullé, Yann & Djebbari, Habiba & Fortin, Bernard, 2009. "Identification of peer effects through social networks," Journal of Econometrics, Elsevier, vol. 150(1), pages 41-55, May.
    4. Imbens, Guido W., 2014. "Instrumental Variables: An Econometrician's Perspective," IZA Discussion Papers 8048, IZA Network @ LISER.
    5. Sinan Aral & Dylan Walker, 2011. "Creating Social Contagion Through Viral Product Design: A Randomized Trial of Peer Influence in Networks," Management Science, INFORMS, vol. 57(9), pages 1623-1639, February.
    6. Maxime C. Cohen & Pavithra Harsha, 2020. "Designing Price Incentives in a Network with Social Interactions," Manufacturing & Service Operations Management, INFORMS, vol. 22(2), pages 292-309, March.
    7. Na Liu & Shuyun Ren & Tsan-Ming Choi & Chi-Leung Hui & Sau-Fun Ng, 2013. "Sales Forecasting for Fashion Retailing Service Industry: A Review," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-9, November.
    8. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Rege, Mari, 2008. "Why do people care about social status?," Journal of Economic Behavior & Organization, Elsevier, vol. 66(2), pages 233-242, 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. Sagaert, Yves R. & Kourentzes, Nikolaos, 2025. "Inventory management with leading indicator augmented hierarchical forecasts," Omega, Elsevier, vol. 136(C).
    2. Yijie Wang & Viet Anh Nguyen & Grani A. Hanasusanto, 2024. "Wasserstein Robust Classification with Fairness Constraints," Manufacturing & Service Operations Management, INFORMS, vol. 26(4), pages 1567-1585, July.

    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. Wu, Zhibin & Li, Yueyuan & Pedrycz, Witold, 2026. "Peer influence in social network: a review of identification, modeling and application," Journal of Business Research, Elsevier, vol. 203(C).
    2. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    3. Qi Luo & Viswanath Nagarajan & Alexander Sundt & Yafeng Yin & John Vincent & Mehrdad Shahabi, 2023. "Efficient Algorithms for Stochastic Ride-Pooling Assignment with Mixed Fleets," Transportation Science, INFORMS, vol. 57(4), pages 908-936, July.
    4. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    5. Valente, Matteo & Reniers, Genserik & Cozzani, Valerio, 2026. "Techno-Economic Analysis of Protection Barriers Against Fire-Induced Domino Effects in the Chemical and Process Industry," Reliability Engineering and System Safety, Elsevier, vol. 266(PB).
    6. Guanyi Wang, 2024. "Robust Network Targeting with Multiple Nash Equilibria," Papers 2410.20860, arXiv.org, revised Nov 2024.
    7. Yuval Filmus & Yasushi Kawase & Yusuke Kobayashi & Yutaro Yamaguchi, 2021. "Tight Approximation for Unconstrained XOS Maximization," Mathematics of Operations Research, INFORMS, vol. 46(4), pages 1599-1610, November.
    8. Jiaming Hu & Dachuan Xu & Donglei Du & Cuixia Miao, 2024. "Differentially private submodular maximization with a cardinality constraint over the integer lattice," Journal of Combinatorial Optimization, Springer, vol. 47(4), pages 1-24, May.
    9. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    10. Daichi Shimamoto & Yasuyuki Todo & Yu Ri Kim & Petr Matous, 2022. "Identifying and decomposing peer effects on decision-making using a randomized controlled trial," Empirical Economics, Springer, vol. 63(2), pages 1029-1058, August.
    11. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    12. Bin Liu & Miaomiao Hu, 2022. "Fast algorithms for maximizing monotone nonsubmodular functions," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1655-1670, July.
    13. repec:dgr:rugsom:99a17 is not listed on IDEAS
    14. Omar El Housni & Huseyin Topaloglu, 2023. "Joint Assortment Optimization and Customization Under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments," Operations Research, INFORMS, vol. 71(4), pages 1197-1215, July.
    15. Lehmann, Daniel, 2020. "Quality of local equilibria in discrete exchange economies," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 141-152.
    16. Michael Kahr & Markus Leitner & Ivana Ljubić, 2024. "The Impact of Passive Social Media Viewers in Influence Maximization," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1362-1381, December.
    17. Anthony Kim & Vahab Mirrokni & Hamid Nazerzadeh, 2021. "Deals or No Deals: Contract Design for Online Advertising," Operations Research, INFORMS, vol. 69(5), pages 1450-1467, September.
    18. Levi DeValve & Saša Pekeč & Yehua Wei, 2023. "Approximate Submodularity in Network Design Problems," Operations Research, INFORMS, vol. 71(4), pages 1021-1039, July.
    19. Dean Eckles & Hossein Esfandiari & Elchanan Mossel & M. Amin Rahimian, 2022. "Seeding with Costly Network Information," Operations Research, INFORMS, vol. 70(4), pages 2318-2348, July.
    20. Eric DuBois & Ashley Peper & Laura A. Albert, 2023. "Interdicting Attack Plans with Boundedly Rational Players and Multiple Attackers: An Adversarial Risk Analysis Approach," Decision Analysis, INFORMS, vol. 20(3), pages 202-219, September.
    21. Shengminjie Chen & Donglei Du & Wenguo Yang & Suixiang Gao, 2024. "Maximizing stochastic set function under a matroid constraint from decomposition," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-21, August.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:inm:ormsom:v:25:y:2023:i:2:p:448-467. 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.