Journal article · 2017

Near-Optimal Regret Bounds for Thompson Sampling

Shipra Agrawal, Navin Goyal

Journal of the ACM, 64(5), 1–24 · Published 4 September 2017 · DOI 10.1145/3088510

View at the publisherCite this paper

In brief

“Near-Optimal Regret Bounds for Thompson Sampling” is a 2017 journal article by Shipra Agrawal and Navin Goyal, published in Journal of the ACM. OpenAlex counts 236 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
236
Most cited in
2025 (41)
Field-weighted impact
9.56
References
38
Authors
2

Abstract

Thompson Sampling (TS) is one of the oldest heuristics for multiarmed bandit problems. It is a randomized algorithm based on Bayesian ideas and has recently generated significant interest after several studies demonstrated that it has favorable empirical performance compared to the state-of-the-art methods. In this article, a novel and almost tight martingale-based regret analysis for… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Agrawal, S., & Goyal, N. (2017). Near-Optimal Regret Bounds for Thompson Sampling. Journal of the ACM, 64(5), 1–24. https://doi.org/10.1145/3088510

MLA 9

Agrawal, Shipra, and Navin Goyal. “Near-Optimal Regret Bounds for Thompson Sampling.” Journal of the ACM, vol. 64, no. 5, 2017, pp. 1–24. https://doi.org/10.1145/3088510.

Chicago

Agrawal, Shipra and Navin Goyal. 2017. “Near-Optimal Regret Bounds for Thompson Sampling.” Journal of the ACM 64 (5): 1–24. https://doi.org/10.1145/3088510.

Harvard

Agrawal, S. and Goyal, N. (2017) ‘Near-Optimal Regret Bounds for Thompson Sampling’, Journal of the ACM, 64(5), pp. 1–24. doi:10.1145/3088510.

IEEE

S. Agrawal and N. Goyal, “Near-Optimal Regret Bounds for Thompson Sampling,” Journal of the ACM, vol. 64, no. 5, pp. 1–24, 2017, doi: 10.1145/3088510.

BibTeX

@article{agrawal2017near,
  title     = {{Near-Optimal Regret Bounds for Thompson Sampling}},
  author    = {Agrawal, Shipra and Goyal, Navin},
  journal   = {Journal of the ACM},
  year      = {2017},
  volume    = {64},
  number    = {5},
  pages     = {1--24},
  doi       = {10.1145/3088510},
  url       = {https://doi.org/10.1145/3088510}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201711
201899
20191616
20202121
20212626
20222020
20232525
20243838
20254141
20263939

Its field-weighted citation impact is 9.56: it has been cited 9.56 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 › Advanced Bandit Algorithms Research

  • Thompson sampling
  • multi-armed bandits
  • regret bounds
  • Gaussian prior
  • beta prior
  • regret lower bounds

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Agrawal, S., & Goyal, N. (2017). Near-Optimal Regret Bounds for Thompson Sampling. Journal of the ACM, 64(5), 1–24. https://doi.org/10.1145/3088510

How many times has this paper been cited?

236 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Shipra Agrawal, Navin Goyal.

What is the DOI of this paper?

10.1145/3088510, permanently at https://doi.org/10.1145/3088510. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 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.