On the optimal amount of experimentation in sequential decision problems
We provide a tight bound on the amount of experimentation under the optimal strategy in sequential decision problems. We show the applicability of the result by providing a bound on the cut-off in a one-arm bandit problem.
Year of publication: |
2010
|
---|---|
Authors: | Rosenberg, Dinah ; Solan, Eilon ; Vieille, Nicolas |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 80.2010, 5-6, p. 381-385
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Social learning in one-arm bandit problems
Rosenberg, Dinah, (2004)
-
On a Markov game with incomplete information
Hörner, Johannes, (2006)
-
Stopping Games with Randomized Strategies
Rosenberg, Dinah, (1999)
- More ...