Robbing the bandit
From MaRDI portal
Publication:3581558
DOI10.1145/1109557.1109660zbMath1192.90164OpenAlexW4237780889MaRDI QIDQ3581558
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109660
Related Items (5)
Following the Perturbed Leader to Gamble at Multi-armed Bandits ⋮ Combinatorial bandits ⋮ Online linear optimization and adaptive routing ⋮ Regret bounded by gradual variation for online convex optimization ⋮ General bounds for incremental maximization
This page was built for publication: Robbing the bandit
