Budgeted multi-armed bandit in continuous action space
From MaRDI portal
Publication:4576192
DOI10.3233/978-1-61499-672-9-560zbMATH Open1396.91051OpenAlexW2574025500MaRDI QIDQ4576192FDOQ4576192
Authors: Francesco Trovò, Stefano Paladino, Marcello Restelli, Nicola Gatti
Publication date: 12 July 2018
Full work available at URL: https://doi.org/10.3233/978-1-61499-672-9-560
Recommendations
Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) Probabilistic games; gambling (91A60)
Cited In (5)
- Learning Theory
- Efficient, optimal stochastic-action selection when limited by an action budget
- Online joint bid/daily budget optimization of Internet advertising campaigns
- Differentially private and budget-limited bandit learning over matroids
- Asymptotically optimal algorithms for budgeted multiple play bandits
This page was built for publication: Budgeted multi-armed bandit in continuous action space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576192)