Algorithms for Adversarial Bandit Problems with Multiple Plays

DOI10.1007/978-3-642-16108-7_30zbMath1306.68059OpenAlexW1569127318MaRDI QIDQ4930712

Atsuyoshi Nakamura, Taishi Uchiya, Mineichi Kudo

Publication date: 1 October 2010

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

Full work available at URL: http://hdl.handle.net/2115/47057

zbMATH Keywords

online learningmulti-armed bandit problemadversarial bandit problem

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Multistage and repeated games (91A20) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Unnamed Item ⋮ Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science

This page was built for publication: Algorithms for Adversarial Bandit Problems with Multiple Plays