Randomized Rules for the Two-Armed-Bandit with Finite Memory
Samuels, S. M.
Ann. Math. Statist., Tome 39 (1968) no. 6, p. 2103-2107 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
In the "two-armed-bandit with finite memory" problem, each rule which has been proposed (see [2], [3], and [4]) can be improved by using a corresponding randomized rule. The performance of various randomized rules is computed.
Publié le : 1968-12-14
Classification:  
@article{1177698038,
     author = {Samuels, S. M.},
     title = {Randomized Rules for the Two-Armed-Bandit with Finite Memory},
     journal = {Ann. Math. Statist.},
     volume = {39},
     number = {6},
     year = {1968},
     pages = { 2103-2107},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1177698038}
}

Samuels, S. M. Randomized Rules for the Two-Armed-Bandit with Finite Memory. Ann. Math. Statist., Tome 39 (1968) no. 6, pp.  2103-2107. http://gdmltest.u-ga.fr/item/1177698038/