Conference paper · 2014

Thompson Sampling for Complex Online Problems

Aditya Gopalan, Shie Mannor, Yishay Mansour

International Conference on Machine Learning, 100–108 · Published 21 June 2014

View at the publisherCite this paper

In brief

“Thompson Sampling for Complex Online Problems” is a 2014 conference paper by Aditya Gopalan and 2 co-authors, published in International Conference on Machine Learning. OpenAlex counts 210 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
210
Most cited in
2020 (27)
Field-weighted impact
21.31
References
25
Authors
3

Abstract

We consider stochastic multi-armed bandit prob-lems with complex actions over a set of basic arms, where the decision maker plays a complex action rather than a basic arm in each round. The reward of the complex action is some function of the basic arms ’ rewards, and the feedback ob-served may not necessarily be the… 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

Gopalan, A., Mannor, S., & Mansour, Y. (2014). Thompson Sampling for Complex Online Problems. International Conference on Machine Learning, 100–108. http://proceedings.mlr.press/v32/gopalan14.pdf

MLA 9

Gopalan, Aditya, et al. “Thompson Sampling for Complex Online Problems.” International Conference on Machine Learning, 2014, pp. 100–108. http://proceedings.mlr.press/v32/gopalan14.pdf.

Chicago

Gopalan, Aditya, Shie Mannor, and Yishay Mansour. 2014. “Thompson Sampling for Complex Online Problems.” International Conference on Machine Learning: 100–108. http://proceedings.mlr.press/v32/gopalan14.pdf.

Harvard

Gopalan, A., Mannor, S. and Mansour, Y. (2014) ‘Thompson Sampling for Complex Online Problems’, International Conference on Machine Learning, pp. 100–108. Available at: http://proceedings.mlr.press/v32/gopalan14.pdf.

IEEE

A. Gopalan, S. Mannor, and Y. Mansour, “Thompson Sampling for Complex Online Problems,” International Conference on Machine Learning, pp. 100–108, 2014.

BibTeX

@inproceedings{gopalan2014thompson,
  title     = {{Thompson Sampling for Complex Online Problems}},
  author    = {Gopalan, Aditya and Mannor, Shie and Mansour, Yishay},
  booktitle = {International Conference on Machine Learning},
  year      = {2014},
  pages     = {100--108},
  url       = {http://proceedings.mlr.press/v32/gopalan14.pdf}
}

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

Citations by year

YearCitationsShare of the best year
20171818
20182424
20191919
20202727
20212525
20221313
20232020
20241616
20251111
202699

Its field-weighted citation impact is 21.31: it has been cited 21.31 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
  • stochastic bandits
  • complex action
  • regret bounds
  • subset selection
  • particle filter
  • job scheduling

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?

Gopalan, A., Mannor, S., & Mansour, Y. (2014). Thompson Sampling for Complex Online Problems. International Conference on Machine Learning, 100–108. http://proceedings.mlr.press/v32/gopalan14.pdf

How many times has this paper been cited?

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

Aditya Gopalan, Shie Mannor, Yishay Mansour.

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.