IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v72y2026i3p2168-2187.html

Learning to Price Supply Chain Contracts Against a Learning Retailer

Author

Listed:
  • Xuejun Zhao

    (Belk College of Business, University of North Carolina at Charlotte, Charlotte, North Carolina 28223)

  • Ruihao Zhu

    (SC Johnson College of Business, Cornell University, Ithaca, New York 14853)

  • William B. Haskell

    (Mitchell E. Daniels, Jr. School of Business, Purdue University, West Lafayette, Indiana 47907)

Abstract

The rise of big data analytics has automated the decision-making of companies and increased supply chain agility. In this paper, we study the supply chain contract design problem faced by a data-driven supplier (she) who needs to respond to the inventory decisions of the downstream retailer (he). Both the supplier and the retailer are uncertain about the market demand and need to learn about it sequentially over a fixed time horizon. In addition, the supplier does not know the retailer’s inventory learning policy, which may change dynamically. The goal for the supplier is to develop data-driven pricing policies with sublinear regret bounds under a wide range of possible retailer inventory learning policies. To capture the dynamics induced by the retailer’s inventory learning policy, we establish a connection with nonstationary online learning by following the notion of a variation budget. We start by making the observation that existing approaches for nonstationary online learning cannot precisely delineate the dynamics incurred by the retailer’s inventory learning policy, and may lead to linear growth in the supplier’s regret under some well-known retailer inventory learning policies. To overcome this challenge, we introduce a new notion of variation budget, which better quantifies the impact of the retailer’s learning on the supplier’s decision-making environment. We also demonstrate the advantages of our new model for the variation budget in our setting over those in the existing literature. We then proceed to propose dynamic pricing policies for the supplier for both discrete and continuous demand distributions. Our pricing policies lead to sublinear regret bounds for the supplier under a wide range of retailer inventory learning policies. Our pricing policies empirically outperform those from the existing nonstationary online learning literature. At the managerial level, we answer affirmatively that there is a pricing policy with a sublinear regret bound for the supplier under a wide range of retailer inventory learning policies, even though she faces a learning retailer and an unknown demand distribution. Our work also provides a novel perspective in data-driven operations management where the principal has to learn to react to the learning policies employed by other agents in the system.

Suggested Citation

  • Xuejun Zhao & Ruihao Zhu & William B. Haskell, 2026. "Learning to Price Supply Chain Contracts Against a Learning Retailer," Management Science, INFORMS, vol. 72(3), pages 2168-2187, March.
  • Handle: RePEc:inm:ormnsc:v:72:y:2026:i:3:p:2168-2187
    DOI: 10.1287/mnsc.2022.03339
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2022.03339
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2022.03339?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. N. Bora Keskin & John R. Birge, 2019. "Dynamic Selling Mechanisms for Product Differentiation and Learning," Operations Research, INFORMS, vol. 67(4), pages 1069-1089, July.
    2. Gah-Yi Ban & N. Bora Keskin, 2021. "Personalized Dynamic Pricing with Machine Learning: High-Dimensional Features and Heterogeneous Elasticity," Management Science, INFORMS, vol. 67(9), pages 5549-5568, September.
    3. Negin Golrezaei & Vahideh Manshadi & Jon Schneider & Shreyas Sekar, 2023. "Learning Product Rankings Robust to Fake Users," Operations Research, INFORMS, vol. 71(4), pages 1171-1196, July.
    4. John R. Birge & Hongfan (Kevin) Chen & N. Bora Keskin, 2025. "Markdown Policies for Demand Learning with Forward-Looking Customers," Operations Research, INFORMS, vol. 73(5), pages 2550-2566, September.
    5. Ming Chen & Zhi-Long Chen, 2015. "Recent Developments in Dynamic Pricing Research: Multiple Products, Competition, and Limited Demand Information," Production and Operations Management, Production and Operations Management Society, vol. 24(5), pages 704-731, May.
    6. Aharon Ben-Tal & Dick den Hertog & Anja De Waegenaere & Bertrand Melenberg & Gijs Rennen, 2013. "Robust Solutions of Optimization Problems Affected by Uncertain Probabilities," Management Science, INFORMS, vol. 59(2), pages 341-357, April.
    7. Alison L. Gibbs & Francis Edward Su, 2002. "On Choosing and Bounding Probability Metrics," International Statistical Review, International Statistical Institute, vol. 70(3), pages 419-435, December.
    8. Retsef Levi & Georgia Perakis & Joline Uichanco, 2015. "The Data-Driven Newsvendor Problem: New Bounds and Insights," Operations Research, INFORMS, vol. 63(6), pages 1294-1306, December.
    9. Arnoud V. den Boer & N. Bora Keskin, 2022. "Dynamic Pricing with Demand Learning and Reference Effects," Management Science, INFORMS, vol. 68(10), pages 7112-7130, October.
    10. N. Bora Keskin & Yuexing Li & Jing-Sheng Song, 2022. "Data-Driven Dynamic Pricing and Ordering with Perishable Inventory in a Changing Environment," Management Science, INFORMS, vol. 68(3), pages 1938-1958, March.
    11. Josef Broder & Paat Rusmevichientong, 2012. "Dynamic Pricing Under a General Parametric Choice Model," Operations Research, INFORMS, vol. 60(4), pages 965-980, August.
    12. Wang Chi Cheung & David Simchi-Levi & He Wang, 2017. "Technical Note—Dynamic Pricing and Demand Learning with Limited Price Experimentation," Operations Research, INFORMS, vol. 65(6), pages 1722-1731, December.
    13. Alon Cohen & Moran Koren & Argyrios Deligkas, 2018. "Learning Approximately Optimal Contracts," Papers 1811.06736, arXiv.org, revised Jul 2022.
    14. Arnoud V. den Boer & N. Bora Keskin, 2020. "Discontinuous Demand Functions: Estimation and Pricing," Management Science, INFORMS, vol. 66(10), pages 4516-4534, October.
    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. Xuejun Zhao & Ruihao Zhu & William B. Haskell, 2022. "Learning to Price Supply Chain Contracts against a Learning Retailer," Papers 2211.04586, arXiv.org.
    2. Boxiao Chen & David Simchi-Levi & Yining Wang & Yuan Zhou, 2022. "Dynamic Pricing and Inventory Control with Fixed Ordering Cost and Incomplete Demand Information," Management Science, INFORMS, vol. 68(8), pages 5684-5703, August.
    3. N. Bora Keskin & Yuexing Li & Jing-Sheng Song, 2022. "Data-Driven Dynamic Pricing and Ordering with Perishable Inventory in a Changing Environment," Management Science, INFORMS, vol. 68(3), pages 1938-1958, March.
    4. John R. Birge & Hongfan (Kevin) Chen & N. Bora Keskin & Amy Ward, 2024. "To Interfere or Not To Interfere: Information Revelation and Price-Setting Incentives in a Multiagent Learning Environment," Operations Research, INFORMS, vol. 72(6), pages 2391-2412, November.
    5. Yang, Xiangyu & Zhang, Jianghua & Hu, Jian-Qiang & Hu, Jiaqiao, 2024. "Nonparametric multi-product dynamic pricing with demand learning via simultaneous price perturbation," European Journal of Operational Research, Elsevier, vol. 319(1), pages 191-205.
    6. Maxime C. Cohen & Sentao Miao & Yining Wang, 2025. "Dynamic Pricing with Fairness Constraints," Operations Research, INFORMS, vol. 73(6), pages 3027-3043, November.
    7. Ningyuan Chen & Guillermo Gallego, 2022. "A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint," Mathematics of Operations Research, INFORMS, vol. 47(4), pages 2585-2613, November.
    8. Xiaocheng Li & Zeyu Zheng, 2024. "Dynamic Pricing with External Information and Inventory Constraint," Management Science, INFORMS, vol. 70(9), pages 5985-6001, September.
    9. Tao Shen & Yifan Cui, 2026. "Proxy-Aided Demand Learning with an Application to Various Pricing Problems," Operations Research, INFORMS, vol. 74(2), pages 770-787, March.
    10. N. Bora Keskin & Meng Li, 2024. "Selling Quality-Differentiated Products in a Markovian Market with Unknown Transition Probabilities," Operations Research, INFORMS, vol. 72(3), pages 885-902, May.
    11. Qi Feng & J. George Shanthikumar & Jian Wu, 2025. "Contextual Data-Integrated Newsvendor Solution with Operational Data Analytics (ODA)," Management Science, INFORMS, vol. 71(11), pages 9384-9403, November.
    12. Ningyuan Chen & Ming Hu, 2023. "Frontiers in Service Science: Data-Driven Revenue Management: The Interplay of Data, Model, and Decisions," Service Science, INFORMS, vol. 15(2), pages 79-91, June.
    13. Xi Chen & Sentao Miao & Yining Wang, 2023. "Differential Privacy in Personalized Pricing with Nonparametric Demand Models," Operations Research, INFORMS, vol. 71(2), pages 581-602, March.
    14. David Simchi-Levi & Chonghuan Wang, 2026. "Pricing Experimental Design: Causal Effect, Expected Revenue and Tail Risk," Management Science, INFORMS, vol. 72(2), pages 1157-1174, February.
    15. Boxiao Chen & Yining Wang & Yuan Zhou, 2024. "Optimal Policies for Dynamic Pricing and Inventory Control with Nonparametric Censored Demands," Management Science, INFORMS, vol. 70(5), pages 3362-3380, May.
    16. Lalit Jain & Zhaoqi Li & Erfan Loghmani & Blake Mason & Hema Yoganarasimhan, 2024. "Effective Adaptive Exploration of Prices and Promotions in Choice-Based Demand Models," Marketing Science, INFORMS, vol. 43(5), pages 1002-1030, September.
    17. John R. Birge & Hongfan (Kevin) Chen & N. Bora Keskin, 2025. "Markdown Policies for Demand Learning with Forward-Looking Customers," Operations Research, INFORMS, vol. 73(5), pages 2550-2566, September.
    18. Jiameng Lyu & Jinxing Xie & Shilin Yuan & Yuan Zhou, 2025. "A Minibatch Stochastic Gradient Descent-Based Learning Metapolicy for Inventory Systems with Myopic Optimal Policy," Management Science, INFORMS, vol. 71(7), pages 5572-5588, July.
    19. Qing Feng & Ruihao Zhu & Stefanus Jasin, 2025. "Temporal Fairness in Learning and Earning: Price Protection Guarantee and Phase Transitions," Operations Research, INFORMS, vol. 73(2), pages 775-797, March.
    20. Jianyu Xu & Yining Wang & Xi Chen & Yu-Xiang Wang, 2025. "Dynamic Pricing with Adversarially-Censored Demands," Papers 2502.06168, arXiv.org, revised Jan 2026.

    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:ormnsc:v:72:y:2026:i:3:p:2168-2187. 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.