Branching bandits and Klimov's problem: achievable region and side constraints (Q4875981)
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: Branching bandits and Klimov's problem: achievable region and side constraints |
scientific article; zbMATH DE number 870772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branching bandits and Klimov's problem: achievable region and side constraints |
scientific article; zbMATH DE number 870772 |
Statements
Branching bandits and Klimov's problem: achievable region and side constraints (English)
0 references
13 June 1996
0 references
average cost branching bandits problem
0 references
optimal policies
0 references
0.7862333059310913
0 references
0.7592732310295105
0 references
