The budgeted multi-armed bandit problem

DOI10.1007/978-3-540-27819-1_46MaRDI QIDQ4680915zbMATH OpenOpenAlexFDO

Authors Omid Madani, Daniel J. Lizotte, Russell Greiner

Publication date 13 June 2005

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

Full work available at URL https://doi.org/10.1007/b98522

Mathematics Subject Classification ID

Sequential statistical design (62L05) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for budgeted learning problems
• Asymptotically optimal algorithms for budgeted multiple play bandits
• Budgeted multi-armed bandit in continuous action space
• Pure exploration in multi-armed bandits problems
• The Nonstochastic Multiarmed Bandit Problem

Cited in

(11)

• Trading utility and uncertainty: applying the value of information to resolve the exploration-exploitation dilemma in reinforcement learning
• Pure exploration in finitely-armed and continuous-armed bandits
• The Irrevocable Multiarmed Bandit Problem
• Approximation algorithms for budgeted learning problems
• Pure exploration in multi-armed bandits problems
• The \(K\)-armed dueling bandits problem
• Budgeted multi-armed bandit in continuous action space
• Bandits with global convex constraints and objective
• Adaptive policies for sequential sampling under incomplete information and a cost constraint
• RT-GSOM: rough tolerance growing self-organizing map
• On the problem of best arm retention

This page was built for publication: The budgeted multi-armed bandit problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680915)