Preprint · 2015 · Open access

Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays

Junpei Komiyama, Junya Honda, Hiroshi Nakagawa

arXiv (Cornell University) · Published 2 June 2015 · DOI 10.48550/arxiv.1506.00779

Open PDFView at the publisherCite this paper

In brief

“Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays” is a 2015 preprint by Junpei Komiyama and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 130 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
130
Most cited in
2020 (31)
References
29
Authors
3

Abstract

We discuss a multiple-play multi-armed bandit (MAB) problem in which several arms are selected at each round. Recently, Thompson sampling (TS), a randomized algorithm with a Bayesian spirit, has attracted much attention for its empirically excellent performance, and it is revealed to have an optimal regret bound in the standard single-play MAB problem. In this paper, we propose the multiple-play Thompson sampling (MP-TS) algorithm, an extension of TS to the multiple-play MAB problem, and discuss its regret analysis. We prove that MP-TS for binary rewards has the optimal regret upper bound that matches the regret lower bound provided by Anantharam et al. (1987). Therefore, MP-TS is the first computationally efficient algorithm with optimal regret. A set of computer simulations was also conducted, which compared MP-TS with state-of-the-art algorithms. We also propose a modification of MP-TS, which is shown to have better empirical performance.

Cite this paper

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

APA 7

Komiyama, J., Honda, J., & Nakagawa, H. (2015). Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1506.00779

MLA 9

Komiyama, Junpei, et al. “Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays.” arXiv (Cornell University), 2015. https://doi.org/10.48550/arxiv.1506.00779.

Chicago

Komiyama, Junpei, Junya Honda, and Hiroshi Nakagawa. 2015. “Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1506.00779.

Harvard

Komiyama, J., Honda, J. and Nakagawa, H. (2015) ‘Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays’, arXiv (Cornell University). doi:10.48550/arxiv.1506.00779.

IEEE

J. Komiyama, J. Honda, and H. Nakagawa, “Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays,” arXiv (Cornell University), 2015, doi: 10.48550/arxiv.1506.00779.

BibTeX

@misc{komiyama2015optimal,
  title     = {{Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays}},
  author    = {Komiyama, Junpei and Honda, Junya and Nakagawa, Hiroshi},
  howpublished = {arXiv (Cornell University)},
  year      = {2015},
  doi       = {10.48550/arxiv.1506.00779},
  url       = {https://doi.org/10.48550/arxiv.1506.00779}
}

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

Citations by year

YearCitationsShare of the best year
20171212
20181212
20191212
20203131
20212424
20221414
202322
202444
202555
202633

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research

  • Thompson sampling
  • regret lower bounds
  • regret upper bounds
  • Bayesian reinforcement learning
  • regret analysis

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?

Komiyama, J., Honda, J., & Nakagawa, H. (2015). Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1506.00779

How many times has this paper been cited?

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

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Junpei Komiyama, Junya Honda, Hiroshi Nakagawa.

What is the DOI of this paper?

10.48550/arxiv.1506.00779, permanently at https://doi.org/10.48550/arxiv.1506.00779. 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.