The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Online Network Revenue Management Using Thompson Sampling
Open accessAbstract
Thompson sampling is a randomized Bayesian machine learning method, whose original motivation was to sequentially evaluate treatments in clinical trials. In recent years, this method has drawn wide attention, as Internet companies have successfully implemented it for online ad display. In “Online network revenue management using Thompson sampling,” K. Ferreira, D. Simchi-Levi, and H. Wang propose using Thompson sampling for a revenue management problem where the demand function is unknown. A main challenge to adopt Thompson sampling for revenue management is that the original method does not incorporate inventory constraints. However, the authors show that Thompson sampling can be naturally combined with a linear program formulation to include inventory constraints. The result is a dynamic pricing algorithm that incorporates domain knowledge and has strong theoretical performance guarantees as well as promising numerical performance results. Interestingly, the authors demonstrate that Thompson sampling achieves poor performance when it does not take into account domain knowledge. Finally, the proposed dynamic pricing algorithm is highly flexible and is applicable in a range of industries, from airlines and internet advertising all the way to online retailing.
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
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
THOMPSON, W. R. (1933) · Biometrika · doi:10.1093/biomet/25.3-4.285 · Cited by 2,712
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
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S., & Cesa-Bianchi, N. (2012) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000024 · Cited by 1,295
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 by
Analytics for an Online Retailer: Demand Forecasting and Price Optimization
Ferreira, K. J., Lee, B. H. A., & Simchi-Levi, D. (2016) · Manufacturing & Service Operations Management · doi:10.1287/msom.2015.0561 · Cited by 538
Self-citationJackson, I., Ivanov, D., Dolgui, A., & Namdar, J. (2024) · International Journal of Production Research · doi:10.1080/00207543.2024.2309309 · Cited by 441
A Tutorial on Thompson Sampling
Russo, D. J., Van Roy, B., Kazerouni, A., Osband, I., & Wen, Z. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680834710 · Cited by 380
Dynamic Pricing for Intelligent Transportation System in the 6G Unlicensed Band
Bajracharya, R., Shrestha, R., Hassan, S. A., Konstantin, K., & Jung, H. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3120015 · Cited by 16
Metadata
- Authors
- Ferreira, K. J., Simchi-Levi, D., & Wang, H.
- Venue
- Operations Research
- Published
- 2018-11
- Volume
- 66
- Issue
- 6
- Pages
- 1586-1602
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W3112742302
- Cited by
- 243
- References
- 5
- FWCI
- 36.25
- 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: Online Network Revenue Management Using Thompson Sampling. https://app.cochat.ai/papers/10.1287/opre.2018.1755
- The paper
- Ferreira, K. J., Simchi-Levi, D., & Wang, H. (2018). Online Network Revenue Management Using Thompson Sampling. Operations Research. https://doi.org/10.1287/opre.2018.1755
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.