A dynamic programming strategy to balance exploration and exploitation in the bandit problem (Q647433)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A dynamic programming strategy to balance exploration and exploitation in the bandit problem |
scientific article; zbMATH DE number 5977712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming strategy to balance exploration and exploitation in the bandit problem |
scientific article; zbMATH DE number 5977712 |
Statements
A dynamic programming strategy to balance exploration and exploitation in the bandit problem (English)
0 references
23 November 2011
0 references
multi-armed bandit problem
0 references
greedy
0 references
estimation
0 references
0 references
0 references
0.7539145946502686
0 references
0.7476481199264526
0 references
0.7446107864379883
0 references
0.7426541447639465
0 references
