Journal article · 2009 · Open access
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
Operations Research, 57(6), 1407–1420 · Published 24 April 2009 · DOI 10.1287/opre.1080.0640
In brief
“Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms” is a 2009 journal article by Omar Besbes and Assaf J. Zeevi, published in Operations Research. OpenAlex counts 645 citations as of 21 November 2026, which puts it in the top 1% of works published in 2009 by citations. It is open access: the full text is free to read at SSRN Electronic Journal.
- Citations
- 645
- Most cited in
- 2026 (85)
- Field-weighted impact
- 17.98
- References
- 27
- Authors
- 2
Abstract
We consider a single-product revenue management problem where, given an initial inventory, the objective is to dynamically adjust prices over a finite sales horizon to maximize expected revenues. Realized demand is observed over time, but the underlying functional relationship between price and mean demand rate that governs these observations (otherwise known as the demand function or demand curve) is not known. We consider two instances of this problem: (i) a setting where the demand function is assumed to belong to a known parametric family with unknown parameter values; and (ii) a setting where the demand function is assumed to belong to a broad class of functions that need not admit any parametric representation. In each case we develop policies that learn the demand function “on the fly,” and optimize prices based on that. The performance of these algorithms is measured in terms of the regret: the revenue loss relative to the maximal revenues that can be extracted when the demand function is known prior to the start of the selling season. We derive lower bounds on the regret that hold for any admissible pricing policy, and then show that our proposed algorithms achieve a regret that is “close” to this lower bound. The magnitude of the regret can be interpreted as the economic value of prior knowledge on the demand function, manifested as the revenue loss due to model uncertainty.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Besbes, O., & Zeevi, A. J. (2009). Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms. Operations Research, 57(6), 1407–1420. https://doi.org/10.1287/opre.1080.0640
MLA 9
Besbes, Omar, and Assaf J. Zeevi. “Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms.” Operations Research, vol. 57, no. 6, 2009, pp. 1407–1420. https://doi.org/10.1287/opre.1080.0640.
Chicago
Besbes, Omar and Assaf J. Zeevi. 2009. “Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms.” Operations Research 57 (6): 1407–1420. https://doi.org/10.1287/opre.1080.0640.
Harvard
Besbes, O. and Zeevi, A. J. (2009) ‘Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms’, Operations Research, 57(6), pp. 1407–1420. doi:10.1287/opre.1080.0640.
IEEE
O. Besbes and A. J. Zeevi, “Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms,” Operations Research, vol. 57, no. 6, pp. 1407–1420, 2009, doi: 10.1287/opre.1080.0640.
BibTeX
@article{besbes2009dynamic,
title = {{Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms}},
author = {Besbes, Omar and Zeevi, Assaf J.},
journal = {Operations Research},
year = {2009},
volume = {57},
number = {6},
pages = {1407--1420},
doi = {10.1287/opre.1080.0640},
url = {https://doi.org/10.1287/opre.1080.0640}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 30 | |
| 2018 | 34 | |
| 2019 | 50 | |
| 2020 | 48 | |
| 2021 | 48 | |
| 2022 | 59 | |
| 2023 | 51 | |
| 2024 | 37 | |
| 2025 | 56 | |
| 2026 | 85 |
Its field-weighted citation impact is 17.98: it has been cited 17.98 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Supply Chain and Inventory Management
- dynamic pricing
- revenue management
- demand estimation
- regret bounds
- online learning
- price-demand relationship
- model uncertainty
- near-optimal algorithms
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Besbes, O., & Zeevi, A. J. (2009). Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms. Operations Research, 57(6), 1407–1420. https://doi.org/10.1287/opre.1080.0640
How many times has this paper been cited?
645 times, according to OpenAlex on 21 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at SSRN Electronic Journal: sign in and open the full text from this page.
Who wrote this paper?
Omar Besbes, Assaf J. Zeevi.
What is the DOI of this paper?
10.1287/opre.1080.0640, permanently at https://doi.org/10.1287/opre.1080.0640. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 21 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.