Conference paper · 2020

Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions

Charles Riou, Junya Honda

Algorithmic Learning Theory, 777–826 · Published 28 January 2020

View at the publisherCite this paper

In brief

“Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions” is a 2020 conference paper by Charles Riou and Junya Honda, published in Algorithmic Learning Theory. OpenAlex counts 55 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
55
Most cited in
2026 (13)
Field-weighted impact
3.54
Authors
2

Cite this paper

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

APA 7

Riou, C., & Honda, J. (2020). Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions. Algorithmic Learning Theory, 777–826. http://proceedings.mlr.press/v117/riou20a/riou20a.pdf

MLA 9

Riou, Charles, and Junya Honda. “Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions.” Algorithmic Learning Theory, 2020, pp. 777–826. http://proceedings.mlr.press/v117/riou20a/riou20a.pdf.

Chicago

Riou, Charles and Junya Honda. 2020. “Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions.” Algorithmic Learning Theory: 777–826. http://proceedings.mlr.press/v117/riou20a/riou20a.pdf.

Harvard

Riou, C. and Honda, J. (2020) ‘Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions’, Algorithmic Learning Theory, pp. 777–826. Available at: http://proceedings.mlr.press/v117/riou20a/riou20a.pdf.

IEEE

C. Riou and J. Honda, “Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions,” Algorithmic Learning Theory, pp. 777–826, 2020.

BibTeX

@inproceedings{riou2020bandit,
  title     = {{Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions}},
  author    = {Riou, Charles and Honda, Junya},
  booktitle = {Algorithmic Learning Theory},
  year      = {2020},
  pages     = {777--826},
  url       = {http://proceedings.mlr.press/v117/riou20a/riou20a.pdf}
}

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

Citations by year

YearCitationsShare of the best year
201811
202033
202144
20221111
202388
20241010
202555
20261313

Its field-weighted citation impact is 3.54: it has been cited 3.54 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

  • bandit algorithms
  • Thompson sampling
  • multi-armed bandits
  • regret 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?

Riou, C., & Honda, J. (2020). Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions. Algorithmic Learning Theory, 777–826. http://proceedings.mlr.press/v117/riou20a/riou20a.pdf

How many times has this paper been cited?

55 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?

Charles Riou, Junya Honda.

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.