A dynamic programming strategy to balance exploration and exploitation in the bandit problem
β Scribed by Olivier Caelen; Gianluca Bontempi
- Book ID
- 106343155
- Publisher
- Springer Netherlands
- Year
- 2010
- Tongue
- English
- Weight
- 542 KB
- Volume
- 60
- Category
- Article
- ISSN
- 1012-2443
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A max-min problem in the realm of optimum beam design is formulated and thoroughly investigated from a dynamic programming point of view. It is shown that the conditions of optimality can be directly derived from the Hamilton-Jacobi-Bellman equation of the process. The classical Euler-Lagrange equat
## Abstract In this inductive study we investigate the local context surrounding professionals choosing to work on a reducedβload basis. We analyze qualitative data collected from key individuals (spouse, boss, coβworker, and HR manager) composing a network around several professionals working redu