Some optimal strategies for bandit problems with beta prior distributions
From MaRDI portal
Publication:1585898
DOI10.1023/A:1004130209258zbMath1064.62554MaRDI QIDQ1585898
Publication date: 2000
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1004130209258
dynamic allocation of Bernoulli processes; sequential experimentation; Bandit problems; k-failure strategy; m-run strategy; N-learning strategy; non-recalling m-run strategy; staying-with-a-winner; switching-on-a-loser
Related Items
Optimal Bayesian strategies for the infinite-armed Bernoulli bandit, A note on infinite-armed Bernoulli bandit problems with generalized beta prior distributions