The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Extensions of the multiarmed bandit problem: The discounted case
Abstract
There areNindependent machines. Machine i is described by a sequence{X^{i}(s), F^{i}(s)}whereX^{i}(s)is the immediate reward and F^{i}(s) is the information available before i is operated for the sth lime. At each time one operates exacfiy one machine; idle machines remain frozen. The problem is to schedule the operation of the machines so as to maximize the expected total discounted sequence of rewards. An elementary proof shows that to each machine is associated an index, and the optimal policy operates the machine with the largest current index. When the machines are completely observed Markov chains, this coincides with the well-known Gittins index rule, and new algorithms are given for calculating the index. A reformulation of the bandit problem yields the tax problem, which includes, as a special case, Klimov's waiting time problem. Using the concept of superprocess, an index rule is derived for the case where new machines arrive randomly. Finally, continuous time versions of these problems are considered for both preemptive and nonpreemptive disciplines.
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
Optimal Search for the Best Alternative
Weitzman, M. L. (1979) · Econometrica · doi:10.2307/1910412 · Cited by 1,074
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
On Bayesian models in stochastic scheduling
Gittins, J. C., & Glazebrook, K. D. (1977) · Journal of Applied Probability · doi:10.1017/s0021900200025791 · Cited by 69
Multi-Armed Bandits with Discount Factor Near One: The Bernoulli Case
Kelly, F. P. (1981) · The Annals of Statistics · doi:10.1214/aos/1176345578 · Cited by 44
Stoppable families of alternative bandit processes
Glazebrook, K. D. (1979) · Journal of Applied Probability · doi:10.1017/s0021900200033532 · Cited by 39
A hamiltonian approach to optimal stochastic resource allocation
Nash, P. A., & Gittins, J. C. (1977) · Advances in Applied Probability · doi:10.1017/s0001867800043111 · Cited by 31
On the Many-armed Bandit Problem
Rodman, L. (1978) · The Annals of Probability · doi:10.1214/aop/1176995533 · Cited by 27
On Randomized Dynamic Allocation Indices for the Sequential Design of Experiments
Glazebrook, K. D. (1980) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.2517-6161.1980.tb01134.x · Cited by 23
Bayesian Rules for the Two-Armed Bandit Problem
Wahrenberger, D. L., Antle, C. E., & Klimko, L. A. (1977) · Biometrika · doi:10.1093/biomet/64.1.172 · Cited by 17
Cited by
The Specification and Estimation of Dynamic Stochastic Discrete Choice Models: A Survey
Eckstein, Z., & Wolpin, K. I. (1989) · The Journal of Human Resources · doi:10.2307/145996 · Cited by 257
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
Metadata
- Authors
- Varaiya, P., Walrand, J., & Buyukkoc, C.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1985-05
- Volume
- 30
- Issue
- 5
- Pages
- 426-439
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W1965208040
- Cited by
- 279
- References
- 10
- FWCI
- 10.92
- 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: Extensions of the multiarmed bandit problem: The discounted case. https://app.cochat.ai/papers/10.1109/tac.1985.1103989
- The paper
- Varaiya, P., Walrand, J., & Buyukkoc, C. (1985). Extensions of the multiarmed bandit problem: The discounted case. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1985.1103989
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.