A two armed bandit type problem revisited
Abstract
In a recent paper, M. Benaïm and G. Ben Arous solve a multi-armed bandit problem arising in the theory of learning in games. We propose an short elementary proof of this result based on a variant of the Kronecker Lemma.
Loading...