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.
Recommendations
Cites work
Cited in
(12)- The \(K\)-armed dueling bandits problem
- On optimal prior learning time in the two-armed bandit problem
- A two armed bandit type problem
- On ergodic two-armed bandits
- scientific article; zbMATH DE number 4001250 (Why is no real title available?)
- The two-armed bandit with delayed responses
- scientific article; zbMATH DE number 7380836 (Why is no real title available?)
- scientific article; zbMATH DE number 3911530 (Why is no real title available?)
- Some results on two-armed bandits when both projects vary
- Further contributions to the two-armed bandit problem
- Generalized two-stage bandit problem
- A Note on Bandits with a Twist
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)