Bandit Processes and Dynamic Allocation Indices
Clicks: 3
ID: 292205
1979
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
0.6
/100
3 views
0 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #55 of 145 articles by views in Journal of the Royal Statistical Society Series B (Statistical Methodology)
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 145 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Summary The paper aims to give a unified account of the central concepts in recent work on bandit processes and dynamic allocation indices; to show how these reduce some previously intractable problems to the problem of calculating such indices; and to describe how these calculations may be carried out. Applications to stochastic scheduling, sequential clinical trials and a class of search problems are discussed.
| Reference Key |
openalex_W3125634603
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | John Gittins |
| Journal | Journal of the Royal Statistical Society Series B (Statistical Methodology) |
| Year | 1979 |
| DOI |
10.1111/j.2517-6161.1979.tb01068.x
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.