The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
Asymptotically efficient adaptive allocation rules
Lai, T. L., & Robbins, H. (1985) · Advances in Applied Mathematics · doi:10.1016/0196-8858(85)90002-8 · Cited by 2,406
(2002) · doi:10.1137/s0097539701398375 · Cited by 2,275
The Theory and Practice of Revenue Management
Talluri, K. T., & Van Ryzin, G. J. (2004) · International Series in Operations Research & Management Science · doi:10.1007/b139000 · Cited by 2,243
Some aspects of the sequential design of experiments
Robbins, H. (1952) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1952-09620-8 · Cited by 2,184
Stochastic Estimation of the Maximum of a Regression Function
Kiefer, J., & Wolfowitz, J. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729392 · Cited by 2,133
Adaptive Algorithms and Stochastic Approximations
Benveniste, A., Métivier, M., & Priouret, P. (1990) · Springer eBooks · doi:10.1007/978-3-642-75894-2 · Cited by 2,006
Acceleration of Stochastic Approximation by Averaging
Polyak, B. T., & Juditsky, A. B. (1992) · SIAM Journal on Control and Optimization · doi:10.1137/0330046 · Cited by 1,827 · cited 1×
“However, based on convergence rate results associated with stochastic approximation schemes (see Polyak and Tsybakov (1990) and Polyak and Juditsky (1990)), we expect that the policies associated with Algorithm 4 would achieve at best a regret of order R n ≈ n −1/3 .”
Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
Gallego, G., & van Ryzin, G. (1994) · Management Science · doi:10.1287/mnsc.40.8.999 · Cited by 1,557
Elmaghraby, W., & Keskinocak, P. (2003) · Management Science · doi:10.1287/mnsc.49.10.1287.17315 · Cited by 1,285
An Overview of Pricing Models for Revenue Management
Bitran, G., & Caldentey, R. (2003) · Manufacturing & Service Operations Management · doi:10.1287/msom.5.3.203.16031 · Cited by 793
Bayes Solutions of the Statistical Inventory Problem
Scarf, H. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706264 · Cited by 318
Regret in the On-Line Decision Problem
Foster, D. P., & Vohra, R. (1999) · Games and Economic Behavior · doi:10.1006/game.1999.0740 · Cited by 302
The value of knowing a demand curve: bounds on regret for online posted-price auctions
Kleinberg, R., & Leighton, T. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238232 · Cited by 290
Dynamic Pricing for Nonperishable Products with Demand Learning
Araman, V. F., & Caldentey, R. (2009) · Operations Research · doi:10.1287/opre.1090.0725 · Cited by 282 · cited 1×
“Recent examples include Aviv and Pazgal (2005), Araman and Caldentey (2005), and Farias and Van Roy (2006), all of which assume that a single parameter is unknown.”
Dynamic Pricing with a Prior on Market Response
Farias, V. F., & Van Roy, B. (2010) · Operations Research · doi:10.1287/opre.1090.0729 · Cited by 211
Relative Entropy, Exponential Utility, and Robust Dynamic Pricing
Lim, A. E. B., & Shanthikumar, J. G. (2007) · Operations Research · doi:10.1287/opre.1070.0385 · Cited by 173
Ryzin, G. J. V., & McGill, J. (2000) · Management Science · doi:10.1287/mnsc.46.6.760.11936 · Cited by 155
Toward Robust Revenue Management: Competitive Analysis of Online Booking
Ball, M. O., & Queyranne, M. (2009) · Operations Research · doi:10.1287/opre.1080.0654 · Cited by 155
Dynamic Pricing: A Learning Approach
Bertsimas, D., & Perakis, G. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-29645-x_3 · Cited by 112
Toward Robust Revenue Management: Competitive Analysis of Online BookingPreprint
Queyranne, M., & Ball, M. O. (2006) · SSRN Electronic Journal · doi:10.2139/ssrn.896547 · Cited by 27
Cited by
From Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2020) · Management Science · doi:10.1287/mnsc.2018.3253 · Cited by 784
Introduction to Multi-Armed Bandits
Slivkins, A. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000068 · Cited by 780
Dynamic pricing and learning: Historical origins, current research, and new directions
den Boer, A. V. (2015) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2015.03.001 · Cited by 427
Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies
Keskin, N. B., & Zeevi, A. (2014) · Operations Research · doi:10.1287/opre.2014.1294 · Cited by 300
Self-citationDynamic Pricing for Nonperishable Products with Demand Learning
Araman, V. F., & Caldentey, R. (2009) · Operations Research · doi:10.1287/opre.1090.0725 · Cited by 282
“Some of the most fundamental questions that these types of studies try to answer relate to the value of learning and whether for instance optimal strategies eventually converge to the true state of the system or not (see Bolton and Harris (1999), Keller and Rady (1999) and references therein).”
Background
Metadata
- Authors
- Besbes, O., & Zeevi, A.
- Venue
- Operations Research
- Published
- 2009-12
- Volume
- 57
- Issue
- 6
- Pages
- 1407-1420
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2140001998
- Cited by
- 506
- References
- 22
- FWCI
- 27.60
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.