A faster index algorithm and a computational study for bandits with switching costs (Q2901010)
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 faster index algorithm and a computational study for bandits with switching costs |
scientific article; zbMATH DE number 6060378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster index algorithm and a computational study for bandits with switching costs |
scientific article; zbMATH DE number 6060378 |
Statements
28 July 2012
0 references
dynamic programming
0 references
Markov finite state bandits
0 references
computational complexity
0 references
A faster index algorithm and a computational study for bandits with switching costs (English)
0 references
0.8448785543441772
0 references
0.8446678519248962
0 references
0.8446677923202515
0 references
0.8429322242736816
0 references
