A two armed bandit type problem revisited

From MaRDI portal
Publication:3373746




Abstract: In a recent paper, M. Bena"{i}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.









This page was built for publication: A two armed bandit type problem revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373746)