
doi: 10.1007/bf02204367
The dynamic programming approach to the solution of the two armed bandit problem with one probability known is discussed, for a general prior distribution for the unknown probability. Properties of the objective function and of the stopping boundaries are obtained. The problem of costly observations is discussed.
Sequential statistical design, 510.mathematics, Hamilton-Jacobi theories, Article
Sequential statistical design, 510.mathematics, Hamilton-Jacobi theories, Article
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 13 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
