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

Dynamic Pricing with a Prior on Market Response

Author

Listed:
  • Vivek F. Farias

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

  • Benjamin Van Roy

    (Stanford University, Stanford, California 94305)

Abstract

We study a problem of dynamic pricing faced by a vendor with limited inventory, uncertain about demand, and aiming to maximize expected discounted revenue over an infinite time horizon. The vendor learns from purchase data, so his strategy must take into account the impact of price on both revenue and future observations. We focus on a model in which customers arrive according to a Poisson process of uncertain rate, each with an independent, identically distributed reservation price. Upon arrival, a customer purchases a unit of inventory if and only if his reservation price equals or exceeds the vendor's prevailing price. We propose a simple heuristic approach to pricing in this context, which we refer to as decay balancing. Computational results demonstrate that decay balancing offers significant revenue gains over recently studied certainty equivalent and greedy heuristics. We also establish that changes in inventory and uncertainty in the arrival rate bear appropriate directional impacts on decay balancing prices in contrast to these alternatives, and we derive worst-case bounds on performance loss. We extend the three aforementioned heuristics to address a model involving multiple customer segments and stores, and provide experimental results demonstrating similar relative merits in this context.

Suggested Citation

  • Vivek F. Farias & Benjamin Van Roy, 2010. "Dynamic Pricing with a Prior on Market Response," Operations Research, INFORMS, vol. 58(1), pages 16-29, February.
  • Handle: RePEc:inm:oropre:v:58:y:2010:i:1:p:16-29
    DOI: 10.1287/opre.1090.0729
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1090.0729
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.1090.0729?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. Victor F. Araman & René Caldentey, 2009. "Dynamic Pricing for Nonperishable Products with Demand Learning," Operations Research, INFORMS, vol. 57(5), pages 1169-1188, October.
    2. Yossi Aviv & Amit Pazgal, 2005. "A Partially Observed Markov Decision Process for Dynamic Pricing," Management Science, INFORMS, vol. 51(9), pages 1400-1416, September.
    3. Guillermo Gallego & Garrett van Ryzin, 1997. "A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management," Operations Research, INFORMS, vol. 45(1), pages 24-41, February.
    4. Guillermo Gallego & Garrett van Ryzin, 1994. "Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
    5. Lin, Kyle Y., 2006. "Dynamic pricing with real-time demand learning," European Journal of Operational Research, Elsevier, vol. 174(1), pages 522-538, 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. Yiwei Chen & Vivek F. Farias, 2013. "Simple Policies for Dynamic Pricing with Imperfect Forecasts," Operations Research, INFORMS, vol. 61(3), pages 612-624, June.
    2. 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.
    3. Andrew E. B. Lim & J. George Shanthikumar, 2007. "Relative Entropy, Exponential Utility, and Robust Dynamic Pricing," Operations Research, INFORMS, vol. 55(2), pages 198-214, April.
    4. Yusen Xia & Jian Yang & Tingting Zhou, 2019. "Revenue management under randomly evolving economic conditions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 73-89, February.
    5. Xiao, Baichun & Yang, Wei, 2021. "A Bayesian learning model for estimating unknown demand parameter in revenue management," European Journal of Operational Research, Elsevier, vol. 293(1), pages 248-262.
    6. Aniruddha Dutta, 2019. "Capacity Allocation of Game Tickets Using Dynamic Pricing," Data, MDPI, vol. 4(4), pages 1-12, October.
    7. Talebian, Masoud & Boland, Natashia & Savelsbergh, Martin, 2014. "Pricing to accelerate demand learning in dynamic assortment planning for perishable products," European Journal of Operational Research, Elsevier, vol. 237(2), pages 555-565.
    8. 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.
    9. 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.
    10. Ioannis Stamatopoulos & Christos Tzamos, 2019. "Design and Dynamic Pricing of Vertically Differentiated Inventories," Management Science, INFORMS, vol. 65(9), pages 4222-4241, September.
    11. Tatsiana Levina & Yuri Levin & Jeff McGill & Mikhail Nediak, 2009. "Dynamic Pricing with Online Learning and Strategic Consumers: An Application of the Aggregating Algorithm," Operations Research, INFORMS, vol. 57(2), pages 327-341, April.
    12. Cao, Ping & Yang, Ke & Liu, Ke, 2020. "Optimal selection and release problem in software testing process: A continuous time stochastic control approach," European Journal of Operational Research, Elsevier, vol. 285(1), pages 211-222.
    13. Yang, Chaolin & Xiong, Yi, 2020. "Nonparametric advertising budget allocation with inventory constraint," European Journal of Operational Research, Elsevier, vol. 285(2), pages 631-641.
    14. Ghate, Archis, 2015. "Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning," European Journal of Operational Research, Elsevier, vol. 245(2), pages 555-570.
    15. Serguei Netessine & Sergei Savin & Wenqiang Xiao, 2006. "Revenue Management Through Dynamic Cross Selling in E-Commerce Retailing," Operations Research, INFORMS, vol. 54(5), pages 893-913, October.
    16. Zhe Yuan & Haoxuan Xu & Yeming (Yale) Gong & Chengbin Chu & Jinlong Zhang, 2017. "Designing public storage warehouses with high demand for revenue maximisation," International Journal of Production Research, Taylor & Francis Journals, vol. 55(13), pages 3686-3700, July.
    17. Yossi Aviv & Mike Mingcheng Wei & Fuqiang Zhang, 2019. "Responsive Pricing of Fashion Products: The Effects of Demand Learning and Strategic Consumer Behavior," Management Science, INFORMS, vol. 65(7), pages 2982-3000, July.
    18. Yiwei Chen & Cong Shi, 2023. "Network revenue management with online inverse batch gradient descent method," Production and Operations Management, Production and Operations Management Society, vol. 32(7), pages 2123-2137, July.
    19. Tamer Boyacı & Özalp Özer, 2010. "Information Acquisition for Capacity Planning via Pricing and Advance Selling: When to Stop and Act?," Operations Research, INFORMS, vol. 58(5), pages 1328-1349, October.
    20. Guillermo Gallego & Michael Z. F. Li & Yan Liu, 2020. "Dynamic Nonlinear Pricing of Inventories over Finite Sales Horizons," Operations Research, INFORMS, vol. 68(3), pages 655-670, May.

    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:58:y:2010:i:1:p:16-29. 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.