Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits

DOI10.1007/978-3-642-24412-4_17zbMath1349.91073arXiv1507.04523OpenAlexW2102665362MaRDI QIDQ3093949

Alexandra Carpentier, Alessandro Lazaric, Peter Auer, Rémi Munos, Mohammad Ghavamzadeh

Publication date: 19 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.04523

Mathematics Subject Classification ID

Rationality and learning in game theory (91A26) Probabilistic games; gambling (91A60)

Related Items (2)

Foraging decisions as multi-armed bandit problems: applying reinforcement learning algorithms to foraging data ⋮ Sequential Design for Ranking Response Surfaces

This page was built for publication: Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits