Bandits with Knapsacks

Foundations of Computer Science, Volume 65, Issue 3, 2018, Pages 207-216.

Cited by: 235|Bibtex|Views52|DOI:https://doi.org/10.1109/FOCS.2013.30
EI WOS
Other Links: dl.acm.org|dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

Multi-armed bandit problems are the predominant theoretical model of exploration-exploitation tradeoffs in learning, and they have countless applications ranging from medical trials, to communication networks, to Web search and advertising. In many of these application domains the learner may be constrained by one or more supply (or budge...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments