The DOI matches its Crossref record.
Multi-Armed Bandit Allocation Indices.
Abstract
3. Multi‐armed Bandit Allocation Indices. By J. C. Gittins. ISBN 0 471 92059 2. Wiley, Chichester, 1989. xii + 252pp. £29.95.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
(2002) · doi:10.1137/s0097539701398375 · Cited by 2,275
Learning about a New Technology: Pineapple in Ghana
Conley, T. G., & Udry, C. R. (2010) · American Economic Review · doi:10.1257/aer.100.1.35 · Cited by 2,180
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S. (2012) · now publishers, Inc. eBooks · doi:10.1561/9781601986276 · Cited by 1,404
Age of Information: An Introduction and Survey
Yates, R. D., Sun, Y., Brown, D. R., Kaul, S. K., Modiano, E., & Ulukus, S. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3065072 · Cited by 1,160
Algorithms for Reinforcement Learning
Szepesvári, C. (2010) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01551-9 · Cited by 1,049
(2011) · Cited by 1,000
Analysis of Thompson Sampling for the multi-armed bandit problem
Agrawal, S., & Goyal, N. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.1797 · Cited by 819
Introduction to Multi-Armed Bandits
Slivkins, A. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000068 · Cited by 780
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
Gambling in a rigged casino: The adversarial multi-armed bandit problem
Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492488 · Cited by 742
A survey of computational complexity results in systems and control
Blondel, V. D., & Tsitsiklis, J. N. (2000) · Automatica · doi:10.1016/s0005-1098(00)00050-9 · Cited by 732
Rationality, foolishness, and adaptive intelligence
March, J. G. (2006) · Strategic Management Journal · doi:10.1002/smj.515 · Cited by 663
Decision theory, reinforcement learning, and the brain
Dayan, P., & Daw, N. D. (2008) · Cognitive, Affective, & Behavioral Neuroscience · doi:10.3758/cabn.8.4.429 · Cited by 580
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
Audibert, J.-Y., Munos, R., & Szepesvári, C. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.01.016 · Cited by 569
An active testing model for tracking roads in satellite images
Geman, D., & Jedynak, B. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.476006 · Cited by 498
Learning to Optimize via Posterior Sampling
Russo, D., & Van Roy, B. (2014) · Mathematics of Operations Research · doi:10.1287/moor.2014.0650 · Cited by 493
The Complexity of Optimal Queuing Network Control
Papadimitriou, C. H., & Tsitsiklis, J. N. (1999) · Mathematics of Operations Research · doi:10.1287/moor.24.2.293 · Cited by 469
Dynamic pricing and learning: Historical origins, current research, and new directions
den Boer, A. V. (2015) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2015.03.001 · Cited by 427
A Tutorial on Thompson Sampling
Russo, D. J., Van Roy, B., Kazerouni, A., Osband, I., & Wen, Z. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680834710 · Cited by 380
Pastor, L., & Veronesi, P. (2009) · Annual Review of Financial Economics · doi:10.1146/annurev.financial.050808.114428 · Cited by 335
Simple and Scalable Response Prediction for Display Advertising
Chapelle, O., Manavoglu, E., & Rosales, R. (2015) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2532128 · Cited by 318
A unified framework for stochastic optimization
Powell, W. B. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.014 · Cited by 314
Applying evolutionary models to the laboratory study of social learning
McElreath, R., Lubell, M., Richerson, P. J., Waring, T. M., Baum, W., Edsten, E., Efferson, C., & Paciotti, B. (2005) · Evolution and Human Behavior · doi:10.1016/j.evolhumbehav.2005.04.003 · Cited by 304
Further Optimal Regret Bounds for Thompson Sampling
Agrawal, S., & Goyal, N. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1209.3353 · Cited by 287
Chao, R. O., & Kavadias, S. (2008) · Management Science · doi:10.1287/mnsc.1070.0828 · Cited by 283
On Patient Flow in Hospitals: A Data-Based Queueing-Science Perspective
Armony, M., Israelit, S. H., Mandelbaum, A., Marmor, Y. N., Tseytlin, Y., & Yom‐Tov, G. B. (2015) · Stochastic Systems · doi:10.1214/14-ssy153 · Cited by 281
A survey of the search theory literature
Benkoski, S. J., Monticino, M. G., & Weisinger, J. R. (1991) · Naval Research Logistics · doi:10.1002/1520-6750(199108)38:4<469::aid-nav3220380404>3.0.co;2-e · Cited by 278
Customer Acquisition via Display Advertising Using Multi-Armed Bandit Experiments
Schwartz, E. M., Bradlow, E. T., & Fader, P. S. (2017) · Marketing Science · doi:10.1287/mksc.2016.1023 · Cited by 260
Interactive collaborative filtering
Zhao, X., Zhang, W., & Wang, J. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505690 · Cited by 165
Industrial targeting, experimentation and long-run specialization
Klimenko, M. M. (2004) · Journal of Development Economics · doi:10.1016/j.jdeveco.2002.09.001 · Cited by 38
El-Bouri, R., Eyre, D. W., Watkinson, P., Zhu, T., & Clifton, D. A. (2021) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2020.2990309 · Cited by 30
Including Learning Analytics in the Loop of Self-Paced Online Course Learning Design
Yan, H., Lin, F., & Kinshuk (2021) · International Journal of Artificial Intelligence in Education · doi:10.1007/s40593-020-00225-z · Cited by 25
Metadata
- Authors
- Bather, J. A., & Gittins, J. C.
- Venue
- Journal of the Royal Statistical Society. Series A (Statistics in Society)
- Publisher
- Oxford University Press (OUP)
- Published
- 1990
- Volume
- 153
- Issue
- 2
- Pages
- 257
- ISSN
- 0964-1998 (ISSN-L)
- OpenAlex
- W2317700292
- Cited by
- 998
- References
- 0
- FWCI
- 16.67
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.