The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies
Open accessAbstract
We consider a monopolist who sells a set of products over a time horizon of T periods. The seller initially does not know the parameters of the products' linear demand curve, but can estimate them based on demand observations. We first assume that the seller knows nothing about the parameters of the demand curve, and then consider the case where the seller knows the expected demand under an incumbent price. It is shown that the smallest achievable revenue loss in T periods, relative to a clairvoyant who knows the underlying demand model, is of order [Formula: see text] in the former case and of order log T in the latter case. To derive pricing policies that are practically implementable, we take as our point of departure the widely used policy called greedy iterated least squares (ILS), which combines sequential estimation and myopic price optimization. It is known that the greedy ILS policy itself suffers from incomplete learning, but we show that certain variants of greedy ILS achieve the minimum asymptotic loss rate. To highlight the essential features of well-performing pricing policies, we derive sufficient conditions for asymptotic optimality.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Pricing and Revenue Optimization
Phillips, R. (2005) · Stanford University Press eBooks · doi:10.1515/9780804781640 · Cited by 602
Pricing and revenue optimization
(2002) · Work Study · doi:10.1108/ws.2002.07951gaf.007 · Cited by 509
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
Besbes, O., & Zeevi, A. (2009) · Operations Research · doi:10.1287/opre.1080.0640 · Cited by 506
Self-citationApplications of the van Trees Inequality: A Bayesian Cramér-Rao Bound
Gill, R. D., & Levit, B. Y. (1995) · Bernoulli · doi:10.2307/3318681 · Cited by 373
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 Under a General Parametric Choice Model
Broder, J., & Rusmevichientong, P. (2012) · Operations Research · doi:10.1287/opre.1120.1057 · Cited by 275
On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning
Besbes, O., & Zeevi, A. (2015) · Management Science · doi:10.1287/mnsc.2014.2031 · Cited by 223
Self-citationSimultaneously Learning and Optimizing Using Controlled Variance Pricing
den Boer, A. V., & Zwart, B. (2014) · Management Science · doi:10.1287/mnsc.2013.1788 · Cited by 214
Bayesian Dynamic Pricing Policies: Learning and Earning Under a Binary Prior Distribution
Harrison, J. M., Keskin, N. B., & Zeevi, A. (2012) · Management Science · doi:10.1287/mnsc.1110.1426 · Cited by 204
Self-citationAdaptive Design and Stochastic Approximation
Lai, T. L., & Robbins, H. E. (1979) · The Annals of Statistics · doi:10.1214/aos/1176344840 · Cited by 143
Cited by
Non-stationary stochastic optimization
Besbes, O., Gur, Y., & Zeevi, A. (2015) · Operations Research · doi:10.1287/opre.2015.1408 · Cited by 337
Self-citationMapping the Ethicality of Algorithmic Pricing: A Review of Dynamic and Personalized Pricing
Seele, P., Dierksmeier, C., Hofstetter, R., & Schultz, M. D. (2021) · Journal of Business Ethics · doi:10.1007/s10551-019-04371-w · Cited by 196
Metadata
- Authors
- Keskin, N. B., & Zeevi, A.
- Venue
- Operations Research
- Published
- 2014-10
- Volume
- 62
- Issue
- 5
- Pages
- 1142-1167
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2161509455
- Cited by
- 300
- References
- 14
- FWCI
- 37.91
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies. https://app.cochat.ai/papers/10.1287/opre.2014.1294
- The paper
- Keskin, N. B., & Zeevi, A. (2014). Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies. Operations Research. https://doi.org/10.1287/opre.2014.1294
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.