The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Combinatorial bandits
Open accessOverview
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
Self-citation(2002) · doi:10.1137/s0097539701398375 · Cited by 2,275
Random Walks and Electric Networks
Doyle, P., & Snell, J. (1984) · Carus Mathematical Monographs · doi:10.5948/upo9781614440222 · Cited by 1,061
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Jerrum, M., Sinclair, A., & Vigoda, E. (2004) · Journal of the ACM · doi:10.1145/1008731.1008738 · Cited by 792
Efficient algorithms for online decision problems
Kalai, A., & Vempala, S. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2004.10.016 · Cited by 591
Polynomial-Time Approximation Algorithms for the Ising Model
Jerrum, M., & Sinclair, A. (1993) · SIAM Journal on Computing · doi:10.1137/0222066 · Cited by 548
Minimax policies for adversarial and stochastic bandits
Audibert, J.-Y., Est, U. P., & Bubeck, S. (2009) · HAL · Cited by 346
Burton, R. M., & Pemantle, R. (1993) · The Annals of Probability · doi:10.1214/aop/1176989121 · Cited by 278
Propp, J. G., & Wilson, D. B. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0917 · Cited by 201
Cited by
Online learning: A comprehensive survey
Hoi, S. C. H., Sahoo, D., Lu, J., & Zhao, P. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.112 · Cited by 746
An Efficient Bandit Algorithm for Realtime Multivariate Optimization
Hill, D. N., Nassif, H., Liu, Y., Iyer, A., & Vishwanathan, S. V. N. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098184 · Cited by 113
“s have shown impressive empiricalperformance[8]andcaneasilyincorporatecontext[2,14]. There is also literature on applying bandit methods to combinatorial problems. This includes combinatorial bandits [7] for subset selection. Submodular bandits also select subsets while considering interactions between retrieved resul…”
BackgroundMethod
Metadata
- Authors
- Cesa-Bianchi, N., & Lugosi, G.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2012-09
- Volume
- 78
- Issue
- 5
- Pages
- 1404-1422
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2914156981
- Cited by
- 319
- References
- 18
- FWCI
- 23.08
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Combinatorial bandits. https://app.cochat.ai/papers/10.1016/j.jcss.2012.01.001
- The paper
- Cesa-Bianchi, N., & Lugosi, G. (2012). Combinatorial bandits. Journal of Computer and System Sciences. https://doi.org/10.1016/j.jcss.2012.01.001
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.
