Ballooning multi-armed bandits
From MaRDI portal
Publication:2238588
DOI10.1016/J.ARTINT.2021.103485OpenAlexW3130258820MaRDI QIDQ2238588FDOQ2238588
Authors: Ganesh Ghalme, Swapnil Dhamal, Shweta Jain, Sujit Gujar, Y. Narahari 
Publication date: 2 November 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.10055
Recommendations
Cites Work
- On the Distribution of the Number of Successes in Independent Trials
- Bandit algorithms
- On the Lambert \(w\) function
- Asymptotically efficient adaptive allocation rules
- Arm-acquiring bandits
- Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges
- Finite-time analysis of the multiarmed bandit problem
- Regret bounds and minimax policies under partial monitoring
- Inequalities on the Lambert \(W\) function and hyperpower function
- 10.1162/153244303321897663
- UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Thompson sampling: an asymptotically optimal finite-time analysis
- A minimax and asymptotically optimal algorithm for stochastic bandits
- Regret bounds for sleeping experts and bandits
- Bandit problems with infinitely many arms
- Introduction to multi-armed bandits
- A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing
- A Tutorial on Thompson Sampling
- Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
This page was built for publication: Ballooning multi-armed bandits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238588)
