The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
The Multi-Armed Bandit Problem: Decomposition and Computation
Abstract
This paper is dedicated to our friend and mentor, Cyrus Derman, on the occasion of his 60th birthday. The multi-armed bandit problem arises in sequentially allocating effort to one of N projects and sequentially assigning patients to one of N treatments in clinical trials. Gittins and Jones (Gittins, J. C., Jones, D. M. 1974. A dynamic allocation index for the sequential design of experiments. J. Gani, K. Sarkadi, L. Vince, eds. Progress in Statistics. European Meeting of Statisticians, 1972, 1, North Holland, Amsterdam, 241–266.) have shown that one optimal policy for the N-project problem, an N-dimensional discounted Markov decision chain, is determined by the following largest-index rule. There is an index for each state of each given project that depends only on the data of that project. In each period one allocates effort to a project with largest current index. The purpose of this paper is to give a short proof of this result and a new characterization of the index of a project in state i, viz., as the maximum expected present value in state i for the restart-in-i problem in which, in each state and period, one either continues allocating effort to the project or immediately restarts the project in state i. Moreover, it is shown that an approximate largest-index rule yields an approximately optimal policy. These results lead to more efficient methods of computing the indices on-line and/or for sparse transition matrices in large state spaces than have been suggested heretofore. By using a suitable implementation of successive approximations, a policy whose expected present value is within 100ϵ% of the maximum possible range of values of the indices can be found on-line with at most (N + T − 1)TM operations where M is the number of operations required to calculate one approximation, T is the least integer majorizing the ratio ln ϵ/ln a and 0 < a < 1 is the discount factor.
Overview
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
Bandit processes and dynamic allocation indices
Gittins, J. C. (1979) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1979.tb01068.x · Cited by 1,487
Multi-Armed Bandits and the Gittins Index
Whittle, P. (1980) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1980.tb01111.x · Cited by 514
Extensions of the multiarmed bandit problem: The discounted case
Varaiya, P., Walrand, J., & Buyukkoc, C. (1985) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1985.1103989 · Cited by 279
Linear Programming for Finite State Multi-Armed Bandit Problems
Chen, Y. R., & Katehakis, M. N. (1986) · Mathematics of Operations Research · doi:10.1287/moor.11.1.180 · Cited by 76
Self-citation
Cited by
A tutorial on Gaussian process regression: modelling, exploring, and exploiting functions
Schulz, E., Speekenbrink, M., & Krause, A. (2018) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2018.03.001 · Cited by 1,735
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
Cognitive Medium Access: Exploration, Exploitation, and Competition
Lai, L., El Gamal, H., Jiang, H., & Poor, H. V. (2011) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.65 · Cited by 351
Advances and challenges in conversational recommender systems: A survey
Gao, C., Lei, W., He, X., de Rijke, M., & Chua, T.-S. (2021) · AI Open · doi:10.1016/j.aiopen.2021.06.002 · Cited by 337
Benchmarking and survey of explanation methods for black box models
Bodria, F., Giannotti, F., Guidotti, R., Naretto, F., Pedreschi, D., & Rinzivillo, S. (2023) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-023-00933-9 · Cited by 264
Metadata
- Authors
- Katehakis, M. N., & Veinott, A. F.
- Venue
- Mathematics of Operations Research
- Published
- 1987-05
- Volume
- 12
- Issue
- 2
- Pages
- 262-268
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2118309135
- Cited by
- 333
- References
- 4
- FWCI
- 4.15
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Multi-Armed Bandit Problem: Decomposition and Computation. https://app.cochat.ai/papers/10.1287/moor.12.2.262
- The paper
- Katehakis, M. N., & Veinott, A. F. (1987). The Multi-Armed Bandit Problem: Decomposition and Computation. Mathematics of Operations Research. https://doi.org/10.1287/moor.12.2.262
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.