The DOI matches its Crossref record.
Relative Entropy, Exponential Utility, and Robust Dynamic Pricing
Abstract
In the area of dynamic revenue management, optimal pricing policies are typically computed on the basis of an underlying demand rate model. From the perspective of applications, this approach implicitly assumes that the model is an accurate representation of the real-world demand process and that the parameters characterizing this model can be accurately calibrated using data. In many situations, neither of these conditions are satisfied. Indeed, models are usually simplified for the purpose of tractability and may be difficult to calibrate because of a lack of data. Moreover, pricing policies that are computed under the assumption that the model is correct may perform badly when this is not the case. This paper presents an approach to single-product dynamic revenue management that accounts for errors in the underlying model at the optimization stage. Uncertainty in the demand rate model is represented using the notion of relative entropy, and a tractable reformulation of the “robust pricing problem” is obtained using results concerning the change of probability measure for point processes. The optimal pricing policy is obtained through a version of the so-called Isaacs’ equation for stochastic differential games, and the structural properties of the optimal solution are obtained through an analysis of this equation. In particular, (i) closed-form solutions for the special case of an exponential nominal demand rate model, (ii) general conditions for the exchange of the “max” and the “min” in the differential game, and (iii) the equivalence between the robust pricing problem and that of single-product revenue management with an exponential utility function without model uncertainty, are established through the analysis of this equation.
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
Cited by
Recent advances in robust optimization: An overview
Gabrel, V., Murat, C., & Thiele, A. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.09.036 · Cited by 912
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
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
Regret in the Newsvendor Model with Partial Information
Perakis, G., & Roels, G. (2008) · Operations Research · doi:10.1287/opre.1070.0486 · Cited by 355
Quantifying Distributional Model Risk via Optimal Transport
Blanchet, J., & Murthy, K. (2019) · Mathematics of Operations Research · doi:10.1287/moor.2018.0936 · Cited by 350
Metadata
- Authors
- Lim, A. E. B., & Shanthikumar, J. G.
- Venue
- Operations Research
- Published
- 2007-04
- Volume
- 55
- Issue
- 2
- Pages
- 198-214
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2139295077
- Cited by
- 173
- References
- 0
- FWCI
- 18.46
- Type
- journal article
- Language
- en
- Open access
- closed
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: Relative Entropy, Exponential Utility, and Robust Dynamic Pricing. https://app.cochat.ai/papers/10.1287/opre.1070.0385
- The paper
- Lim, A. E. B., & Shanthikumar, J. G. (2007). Relative Entropy, Exponential Utility, and Robust Dynamic Pricing. Operations Research. https://doi.org/10.1287/opre.1070.0385
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.