IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v65y2017i6p1722-1731.html
   My bibliography  Save this article

Technical Note—Dynamic Pricing and Demand Learning with Limited Price Experimentation

Author

Listed:
  • Wang Chi Cheung

    (Institute of High Performance Computing, Agency for Science, Technology and Research, Singapore 138632)

  • David Simchi-Levi

    (Department of Civil and Environmental Engineering, MIT Institute for Data, Systems, and Society, Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • He Wang

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

Abstract

In a dynamic pricing problem where the demand function is not known a priori, price experimentation can be used as a demand learning tool. Existing literature usually assumes no constraint on price changes, but in practice, sellers often face business constraints that prevent them from conducting extensive experimentation. We consider a dynamic pricing model where the demand function is unknown but belongs to a known finite set. The seller is allowed to make at most m price changes during T periods. The objective is to minimize the worst-case regret—i.e., the expected total revenue loss compared with a clairvoyant who knows the demand distribution in advance. We demonstrate a pricing policy that incurs a regret of O (log ( m ) T ), or m iterations of the logarithm. Furthermore, we describe an implementation of this pricing policy at Groupon, a large e-commerce marketplace for daily deals. The field study shows significant impact on revenue and bookings.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:oropre:v:65:y:2017:i:6:p:1722-1731
    DOI: 10.1287/opre.2017.1629
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/opre.2017.1629
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2017.1629?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. Youyi Feng & Guillermo Gallego, 1995. "Optimal Starting Times for End-of-Season Sales and Optimal Stopping Times for Promotional Fares," Management Science, INFORMS, vol. 41(8), pages 1371-1391, August.
    2. Omar Besbes & Assaf Zeevi, 2015. "On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning," Management Science, INFORMS, vol. 61(4), pages 723-739, April.
    3. Mark J. Zbaracki & Mark Ritson & Daniel Levy & Shantanu Dutta & Mark Bergen, 2004. "Managerial and Customer Costs of Price Adjustment: Direct Evidence from Industrial Markets," The Review of Economics and Statistics, MIT Press, vol. 86(2), pages 514-533, May.
    4. Rothschild, Michael, 1974. "A two-armed bandit theory of market pricing," Journal of Economic Theory, Elsevier, vol. 9(2), pages 185-202, October.
    5. Arnoud V. den Boer & Bert Zwart, 2014. "Simultaneously Learning and Optimizing Using Controlled Variance Pricing," Management Science, INFORMS, vol. 60(3), pages 770-783, March.
    6. Gabriel R. Bitran & Susana V. Mondschein, 1997. "Periodic Pricing of Seasonal Products in Retailing," Management Science, INFORMS, vol. 43(1), pages 64-79, January.
    7. Arnoud V. den Boer, 2014. "Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 863-888, August.
    8. Zizhuo Wang & Shiming Deng & Yinyu Ye, 2014. "Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems," Operations Research, INFORMS, vol. 62(2), pages 318-331, April.
    9. Netessine, Serguei, 2006. "Dynamic pricing of inventory/capacity with infrequent price changes," European Journal of Operational Research, Elsevier, vol. 174(1), pages 553-580, October.
    10. Josef Broder & Paat Rusmevichientong, 2012. "Dynamic Pricing Under a General Parametric Choice Model," Operations Research, INFORMS, vol. 60(4), pages 965-980, August.
    11. Paat Rusmevichientong & John N. Tsitsiklis, 2010. "Linearly Parameterized Bandits," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 395-411, May.
    12. J. Michael Harrison & N. Bora Keskin & Assaf Zeevi, 2012. "Bayesian Dynamic Pricing Policies: Learning and Earning Under a Binary Prior Distribution," Management Science, INFORMS, vol. 58(3), pages 570-586, March.
    13. Omar Besbes & Assaf Zeevi, 2009. "Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms," Operations Research, INFORMS, vol. 57(6), pages 1407-1420, December.
    14. Felipe Caro & Jérémie Gallien, 2012. "Clearance Pricing Optimization for a Fast-Fashion Retailer," Operations Research, INFORMS, vol. 60(6), pages 1404-1422, December.
    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. Yang, Chaolin & Xiong, Yi, 2020. "Nonparametric advertising budget allocation with inventory constraint," European Journal of Operational Research, Elsevier, vol. 285(2), pages 631-641.
    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. Ilan Lobel, 2021. "Revenue Management and the Rise of the Algorithmic Economy," Management Science, INFORMS, vol. 67(9), pages 5389-5398, September.
    4. Yining Wang & Boxiao Chen & David Simchi-Levi, 2021. "Multimodal Dynamic Pricing," Management Science, INFORMS, vol. 67(10), pages 6136-6152, October.
    5. Sentao Miao & Xi Chen & Xiuli Chao & Jiaxi Liu & Yidong Zhang, 2022. "Context‐based dynamic pricing with online clustering," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3559-3575, September.
    6. Yilin Liang & Yuping Hu & Dongjun Luo & Qi Zhu & Qingxuan Chen & Chunmei Wang, 2023. "Distributed Dynamic Pricing Strategy Based on Deep Reinforcement Learning Approach in a Presale Mechanism," Sustainability, MDPI, vol. 15(13), pages 1-20, July.
    7. Dennis J. Zhang & Hengchen Dai & Lingxiu Dong & Fangfang Qi & Nannan Zhang & Xiaofei Liu & Zhongyi Liu & Jiang Yang, 2020. "The Long-term and Spillover Effects of Price Promotions on Retailing Platforms: Evidence from a Large Randomized Experiment on Alibaba," Management Science, INFORMS, vol. 66(6), pages 2589-2609, June.
    8. Victor Martínez‐de‐Albéniz & Arnau Planas & Stefano Nasini, 2020. "Using Clickstream Data to Improve Flash Sales Effectiveness," Production and Operations Management, Production and Operations Management Society, vol. 29(11), pages 2508-2531, November.
    9. Thomas Loots & Arnoud V. den Boer, 2023. "Data‐driven collusion and competition in a pricing duopoly with multinomial logit demand," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1169-1186, April.
    10. Alexis Asseman & Tomasz Kornuta & Anirudh Patel & Matt Deible & Sam Green, 2022. "Multi-Agent Dynamic Pricing in a Blockchain Protocol Using Gaussian Bandits," Papers 2212.07942, arXiv.org, revised Jan 2023.
    11. Hu Wang & Di Li & Changbin Jiang & Yuxiang Zhang, 2023. "Exploring the Interactive Relationship between Retailers’ Free Shipping Decisions and Manufacturers’ Product Sales in Digital Retailing," Sustainability, MDPI, vol. 15(17), pages 1-19, August.
    12. Er-Rahmadi, Btissam & Ma, Tiejun, 2022. "Data-driven mixed-Integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems," European Journal of Operational Research, Elsevier, vol. 303(1), pages 337-353.
    13. Woonghee Tim Huh & Michael Jong Kim & Meichun Lin, 2022. "Bayesian dithering for learning: Asymptotically optimal policies in dynamic pricing," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3576-3593, September.
    14. Jason Rhuggenaath & Alp Akcay & Yingqian Zhang & Uzay Kaymak, 2022. "Setting Reserve Prices in Second-Price Auctions with Unobserved Bids," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2950-2967, November.
    15. Jian Hu & Junxuan Li & Sanjay Mehrotra, 2019. "A Data-Driven Functionally Robust Approach for Simultaneous Pricing and Order Quantity Decisions with Unknown Demand Function," Operations Research, INFORMS, vol. 67(6), pages 1564-1585, November.
    16. Qi Feng & J. George Shanthikumar, 2022. "Developing operations management data analytics," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4544-4557, December.
    17. 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.
    18. Xuejun Zhao & Ruihao Zhu & William B. Haskell, 2022. "Learning to Price Supply Chain Contracts against a Learning Retailer," Papers 2211.04586, arXiv.org.
    19. Vincent C. Li & Yat-wah Wan & Chi-Leung Chu & Yi-Cheng Lin, 2020. "A Dynamic Programming-Based Heuristic for Markdown Pricing and Inventory Allocation of a Seasonal Product in a Retail Chain," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-30, January.
    20. Malo Huard & Rémy Garnier & Gilles Stoltz, 2020. "Hierarchical robust aggregation of sales forecasts at aggregated levels in e-commerce, based on exponential smoothing and Holt's linear trend method," Working Papers hal-02794320, HAL.
    21. Karsten T. Hansen & Kanishka Misra & Mallesh M. Pai, 2021. "Frontiers: Algorithmic Collusion: Supra-competitive Prices via," Marketing Science, INFORMS, vol. 40(1), pages 1-12, January.
    22. Xi Chen & David Simchi-Levi & Yining Wang, 2022. "Privacy-Preserving Dynamic Personalized Pricing with Demand Learning," Management Science, INFORMS, vol. 68(7), pages 4878-4898, July.
    23. Gel, Esma S. & Salman, F. Sibel, 2022. "Dynamic ordering decisions with approximate learning of supply yield uncertainty," International Journal of Production Economics, Elsevier, vol. 243(C).
    24. Joon Suk Huh & Ellen Vitercik & Kirthevasan Kandasamy, 2024. "Bandit Profit-maximization for Targeted Marketing," Papers 2403.01361, arXiv.org.
    25. Ningyuan Chen & Guillermo Gallego, 2021. "Nonparametric Pricing Analytics with Customer Covariates," Operations Research, INFORMS, vol. 69(3), pages 974-984, May.

    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. Thomas Loots & Arnoud V. den Boer, 2023. "Data‐driven collusion and competition in a pricing duopoly with multinomial logit demand," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1169-1186, April.
    2. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    3. Yang, Chaolin & Xiong, Yi, 2020. "Nonparametric advertising budget allocation with inventory constraint," European Journal of Operational Research, Elsevier, vol. 285(2), pages 631-641.
    4. Omar Besbes & Assaf Zeevi, 2015. "On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning," Management Science, INFORMS, vol. 61(4), pages 723-739, April.
    5. N. Bora Keskin & Assaf Zeevi, 2017. "Chasing Demand: Learning and Earning in a Changing Environment," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 277-307, May.
    6. Arnoud V. den Boer & Bert Zwart, 2015. "Dynamic Pricing and Learning with Finite Inventories," Operations Research, INFORMS, vol. 63(4), pages 965-978, August.
    7. Qi Feng & J. George Shanthikumar, 2022. "Developing operations management data analytics," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4544-4557, December.
    8. Boxiao Chen & Xiuli Chao & Cong Shi, 2021. "Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 726-756, May.
    9. Athanassios N. Avramidis & Arnoud V. Boer, 2021. "Dynamic pricing with finite price sets: a non-parametric approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(1), pages 1-34, August.
    10. Athanassios N. Avramidis, 2020. "A pricing problem with unknown arrival rate and price sensitivity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 77-106, August.
    11. Omar Besbes & Denis Sauré, 2014. "Dynamic Pricing Strategies in the Presence of Demand Shifts," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 513-528, October.
    12. Ying Zhong & L. Jeff Hong & Guangwu Liu, 2021. "Earning and Learning with Varying Cost," Production and Operations Management, Production and Operations Management Society, vol. 30(8), pages 2379-2394, August.
    13. Yining Wang & Xi Chen & Xiangyu Chang & Dongdong Ge, 2021. "Uncertainty Quantification for Demand Prediction in Contextual Dynamic Pricing," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1703-1717, June.
    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.
    15. 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.
    16. Michael N. Katehakis & Yifeng Liu & Jian Yang, 2022. "A revisit to the markup practice of irreversible dynamic pricing," Annals of Operations Research, Springer, vol. 317(1), pages 77-105, October.
    17. Arnoud V. den Boer, 2014. "Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 863-888, August.
    18. Huanan Zhang & Cong Shi & Chao Qin & Cheng Hua, 2016. "Stochastic regret minimization for revenue management problems with nonstationary demands," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(6), pages 433-448, September.
    19. Maxime C. Cohen & Ilan Lobel & Renato Paes Leme, 2020. "Feature-Based Dynamic Pricing," Management Science, INFORMS, vol. 66(11), pages 4921-4943, November.
    20. Xi Chen & Jianjun Gao & Dongdong Ge & Zizhuo Wang, 2022. "Bayesian dynamic learning and pricing with strategic customers," Production and Operations Management, Production and Operations Management Society, vol. 31(8), pages 3125-3142, August.

    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:oropre:v:65:y:2017:i:6:p:1722-1731. 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.