arXiv Analytics

Sign in

arXiv:math/0510351 [math.PR]AbstractReferencesReviewsResources

How fast is the bandit?

Damien Lamberton, Gilles Pagès

Published 2005-10-17Version 1

In this paper we investigate the rate of convergence of the so-called two-armed bandit algorithm in a financial context of asset allocation. The behaviour of the algorithm turns out to be highly non-standard: no CLT whatever the time scale, possible existence of two rate regimes.

Related articles: Most relevant | Search more
arXiv:math/0407128 [math.PR] (Published 2004-07-08)
When can the two-armed bandit algorithm be trusted?
arXiv:1805.05034 [math.PR] (Published 2018-05-14)
A stochastic SIR model on a graph with epidemiological and population dynamics occurring over the same time scale
arXiv:1906.05635 [math.PR] (Published 2019-06-13)
Quasi-Stationary Distributions and Resilience: What to get from a sample?