The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards
Abstract
At each instant of time we are required to sample a fixed numberm \geq 1out ofNi.i.d, processes whose distributions belong to a family suitably parameterized by a real number\theta. The objective is to maximize the long run total expected value of the samples. Following Lai and Robbins, the learning loss of a sampling scheme corresponding to a configuration of parametersC = (\theta_{1},..., \theta_{N})is quantified by the regretR_{n}(C). This is the difference between the maximum expected reward at timenthat could be achieved ifCwere known and the expected reward actually obtained by the sampling scheme. We provide a lower bound for the regret associated with any uniformly good scheme, and construct a scheme which attains the lower bound for every configurationC. The lower bound is given explicitly in terms of the Kullback-Liebler number between pairs of distributions. Part II of this paper considers the same problem when the reward processes are Markovian.
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
Asymptotically efficient adaptive allocation rules
Lai, T. L., & Robbins, H. (1985) · Advances in Applied Mathematics · doi:10.1016/0196-8858(85)90002-8 · Cited by 2,406
Great Expectations: The Theory of Optimal Stopping.
Brown, B. M., Chow, Y. S., Robbins, H., & Siegmund, D. (1972) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344690 · Cited by 510
Large Deviations for a General Class of Random Vectors
Ellis, R. S. (1984) · The Annals of Probability · doi:10.1214/aop/1176993370 · Cited by 401
Approximations to the Expected Sample Size of Certain Sequential Tests
Pollak, M., & Siegmund, D. (1975) · The Annals of Statistics · doi:10.1214/aos/1176343284 · Cited by 124
Cited by
Lattimore, T., & Szepesvári, C. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108571401 · Cited by 976
Distributed Learning in Multi-Armed Bandit With Multiple Players
Liu, K., & Zhao, Q. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2062509 · Cited by 385
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
Liu, K., & Zhao, Q. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2068950 · Cited by 347
Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
Caro, F., & Gallien, J. (2007) · Management Science · doi:10.1287/mnsc.1060.0613 · Cited by 306
Metadata
- Authors
- Anantharam, V., Varaiya, P., & Walrand, J.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1987-11
- Volume
- 32
- Issue
- 11
- Pages
- 968-976
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2125724988
- Cited by
- 358
- References
- 4
- FWCI
- 2.97
- 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: Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards. https://app.cochat.ai/papers/10.1109/tac.1987.1104491
- The paper
- Anantharam, V., Varaiya, P., & Walrand, J. (1987). Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1987.1104491
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.