{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T11:24:28Z","timestamp":1772796268425,"version":"3.50.1"},"reference-count":54,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Management Science"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:p>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\u2019s 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\u2019s 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\u2019s inventory learning policy, and may lead to linear growth in the supplier\u2019s 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\u2019s learning on the supplier\u2019s 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.<\/jats:p>\n                  <jats:p>This paper was accepted by Jeannette Song, operations management.<\/jats:p>\n                  <jats:p>Supplemental Material: The online appendix and data files are available at https:\/\/doi.org\/10.1287\/mnsc.2022.03339 .<\/jats:p>","DOI":"10.1287\/mnsc.2022.03339","type":"journal-article","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T13:56:33Z","timestamp":1753106193000},"page":"2168-2187","source":"Crossref","is-referenced-by-count":0,"title":["Learning to Price Supply Chain Contracts Against a Learning Retailer"],"prefix":"10.1287","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0021-4100","authenticated-orcid":false,"given":"Xuejun","family":"Zhao","sequence":"first","affiliation":[{"name":"Belk College of Business, University of North Carolina at Charlotte, Charlotte, North Carolina 28223"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1463-1308","authenticated-orcid":false,"given":"Ruihao","family":"Zhu","sequence":"additional","affiliation":[{"name":"SC Johnson College of Business, Cornell University, Ithaca, New York 14853"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William B.","family":"Haskell","sequence":"additional","affiliation":[{"name":"Mitchell E. Daniels, Jr. School of Business, Purdue University, West Lafayette, Indiana 47907"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"109","reference":[{"key":"B1","unstructured":"Auer P, Gajane P, Ortner R (2018) Adaptively tracking the best arm with an unknown number of distribution changes.\n                      Proc. Thirty-Second Conf. Learning Theory\n                      , vol. 99 (PMLR, New York), 138\u2013158."},{"key":"B2","first-page":"159","volume-title":"Conf. Learn. Theory","author":"Auer P","year":"2019"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3680"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4071"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1120.1641"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0867"},{"key":"B7","author":"Besbes O","year":"2014","journal-title":"Adv. Neural Inform. Processing Systems"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1287\/stsy.2019.0033"},{"key":"B10","doi-asserted-by":"crossref","unstructured":"Birge JR, Chen H, Keskin NB (2025) Markdown policies for demand learning with forward-looking customers.\n                      Oper. Res.\n                      , ePub ahead of print May 8, https:\/\/doi.org\/10.1287\/opre.2019.0402.","DOI":"10.1287\/opre.2019.0402"},{"key":"B11","doi-asserted-by":"crossref","unstructured":"Birge JR, Chen H, Keskin NB, Ward A (2024) To interfere or not to interfere: Information revelation and price-setting incentives in a multiagent learning environment.\n                      Oper. Res.\n                      72(6):2391\u20132412.","DOI":"10.1287\/opre.2023.0363"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1057"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(03)11006-7"},{"key":"B14","unstructured":"Cao Y, Wen Z, Kveton B, Xie Y (2019) Nearly optimal adaptive procedure with change detection for piecewise-stationary bandit.\n                      22nd Internat. Conf. Artificial Intelligence Statist\n                      . (PMLR, New York), 418\u2013427."},{"key":"B15","unstructured":"Cesa-Bianchi N, Cesari T, Osogami T, Scarsini M, Wasserkrug S (2022) Online learning in supply-chain games. Preprint, submitted July 8, https:\/\/arxiv.org\/abs\/2207.04054."},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1111\/poms.12295"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1843"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2023.4859"},{"key":"B19","first-page":"696","volume-title":"Conf. Learn. Theory","author":"Chen Y","year":"2019"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4171"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1629"},{"key":"B22","doi-asserted-by":"crossref","unstructured":"Cheung WC, Simchi-Levi D, Zhu R (2019) Learning to optimize under non-stationarity.\n                      22nd Internat. Conf. Artificial Intelligence Statist\n                      . (PMLR, New York), 1079\u20131087.","DOI":"10.2139\/ssrn.3261050"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4024"},{"key":"B24","doi-asserted-by":"crossref","unstructured":"Cohen A, Deligkas A, Koren M (2022) Learning approximately optimal contracts.\n                      Internat. Sympos. Algorithmic Game Theory\n                      (Springer, Berlin, Heidelberg), 331\u2013346.","DOI":"10.1007\/978-3-031-15714-1_19"},{"key":"B25","volume-title":"Introduction to Algorithms","author":"Cormen TH","year":"2022"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2019.3446"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4234"},{"key":"B28","unstructured":"EY Americas (2020) How the future of work will change the digital supply chain. Accessed October 4, 2022, https:\/\/www.ey.com\/en_us\/consulting\/how-the-future-of-work-will-change-the-digital-supply-chain."},{"key":"B29","doi-asserted-by":"crossref","unstructured":"Feng Q, Zhu R (2023) Principro: Data-driven algorithms for joint pricing and inventory control under price protection. Preprint, submitted July 24, https:\/\/ssrn.com\/abstract=4511384.","DOI":"10.2139\/ssrn.4511384"},{"key":"B30","doi-asserted-by":"crossref","unstructured":"Feng Q, Zhu R, Jasin S (2023) Temporal fairness in learning and earning: Price protection guarantee and phase transitions.\n                      Proc. 24th ACM Conf. Econom. Comput.\n                      (Association for Computing Machinery, New York).","DOI":"10.1145\/3580507.3597668"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1755"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1111\/j.1751-5823.2002.tb00178.x"},{"key":"B33","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2380"},{"key":"B34","doi-asserted-by":"crossref","unstructured":"Han M, Albert M, Xu H (2024) Learning in online principal-agent interactions: The power of menus.\n                      Proc. AAAI Conf. Artificial Intell\n                      ., vol. 38 (AAAI Press, Palo Alto, CA), 17426\u201317434.","DOI":"10.1609\/aaai.v38i16.29691"},{"key":"B35","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4940"},{"key":"B36","doi-asserted-by":"crossref","unstructured":"Jia H, Shi C, Shen S (2022) Online learning and pricing for network revenue management with reusable resources. Preprint, submitted September 30, https:\/\/ssrn.com\/abstract=4225832.","DOI":"10.2139\/ssrn.4225832"},{"key":"B37","first-page":"199","volume":"29","author":"Karnin ZS","year":"2016","journal-title":"Adv. Neural Inform. Processing Systems"},{"issue":"4","key":"B38","first-page":"1069","volume":"67","author":"Keskin NB","year":"2019","journal-title":"Oper. Res."},{"key":"B39","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0807"},{"key":"B40","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1713"},{"key":"B41","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4011"},{"key":"B42","doi-asserted-by":"crossref","unstructured":"Keskin NB, Min X, Song JSJ (2021) The nonstationary newsvendor: Data-driven nonparametric learning. Preprint, submitted June 15, http:\/\/dx.doi.org\/10.2139\/ssrn.3866171.","DOI":"10.2139\/ssrn.3866171"},{"key":"B43","doi-asserted-by":"publisher","DOI":"10.1145\/3299873"},{"key":"B44","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499363220"},{"key":"B45","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1422"},{"key":"B46","unstructured":"Liu L, Rong Y (2024) A Stackelberg regret minimizing framework for online learning in newsvendor pricing games. Preprint, submitted March 30, https:\/\/arxiv.org\/html\/2404.00203v1."},{"key":"B47","first-page":"1739","volume-title":"Conf. Learn. Theory","author":"Luo H","year":"2018"},{"key":"B48","doi-asserted-by":"crossref","unstructured":"Lykouris T, Mirrokni V, Paes Leme R (2018) Stochastic bandits robust to adversarial corruptions.\n                      Proc. 50th Annual ACM SIGACT Sympos. Theory Comput\n                      . (Association for Computing Machinery, New York), 114\u2013122.","DOI":"10.1145\/3188745.3188918"},{"key":"B49","first-page":"4300","volume-title":"Conf. Learn. Theory","author":"Wei CY","year":"2021"},{"key":"B50","doi-asserted-by":"crossref","unstructured":"Wei L, Srivatsva V (2018) On abruptly-changing and slowly-varying multiarmed bandit problems.\n                      2018\n                      Annual Amer. Control Conf. (ACC)\n                      (IEEE, Piscataway, NJ), 6291\u20136296.","DOI":"10.23919\/ACC.2018.8431265"},{"key":"B51","volume":"29","author":"Wei CY","year":"2016","journal-title":"Adv. Neural Inform. Processing Systems"},{"key":"B52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60990-0_12"},{"key":"B53","unstructured":"Zhou TZ, Liu J, Dong C, Dong J (2021) Incentivized bandit learning with self-reinforcing user preferences.\n                      Proc. 38th Internat. Conf. Machine Learn\n                      . (PMLR, New York)."},{"key":"B54","unstructured":"Zhu B, Bates S, Yang Z, Wang Y, Jiao J, Jordan MI (2022) The sample complexity of online contract design. Preprint, submitted November 10, https:\/\/arxiv.org\/abs\/2211.05732."}],"container-title":["Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/mnsc.2022.03339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:32:14Z","timestamp":1772789534000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/mnsc.2022.03339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10.1287\/mnsc.2022.03339"],"URL":"https:\/\/doi.org\/10.1287\/mnsc.2022.03339","relation":{},"ISSN":["0025-1909","1526-5501"],"issn-type":[{"value":"0025-1909","type":"print"},{"value":"1526-5501","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}