Some optimal strategies for bandit problems with beta prior distributions (Q1585898)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1529882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some optimal strategies for bandit problems with beta prior distributions |
scientific article; zbMATH DE number 1529882 |
Statements
Some optimal strategies for bandit problems with beta prior distributions (English)
0 references
2000
0 references
Bandit problems
0 references
sequential experimentation
0 references
dynamic allocation of Bernoulli processes
0 references
staying-with-a-winner
0 references
switching-on-a-loser
0 references
k-failure strategy
0 references
m-run strategy
0 references
non-recalling m-run strategy
0 references
N-learning strategy
0 references
0.9216229915618896
0 references
0.857990562915802
0 references
0.8455501198768616
0 references
0.8370381593704224
0 references
0.7973557114601135
0 references
