Finite-time lower bounds for the two-armed bandit problem
From MaRDI portal
Publication:4507101
DOI10.1109/9.847107zbMath0991.62059OpenAlexW2021240652MaRDI QIDQ4507101
Sanjeev R. Kulkarni, Gábor Lugosi
Publication date: 17 October 2000
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.847107
Related Items (4)
Arbitrary side observations in bandit problems ⋮ Unnamed Item ⋮ Explore First, Exploit Next: The True Shape of Regret in Bandit Problems ⋮ Adaptive Policies for Sequential Sampling under Incomplete Information and a Cost Constraint
This page was built for publication: Finite-time lower bounds for the two-armed bandit problem