Adversarial Bandits with Knapsacks
2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), pp. 202.0-219, 2019.
We consider Bandits with. Knapsacks (henceforth, BwK), a general model for multi -armed bandits under supply/budget constraints. In particular, a bandit algorithm needs to solve a well-known knapsack problem: find an optimal packing of items into a limited -size knapsack. The BwK problem is a common generalization of numerous motivating e...More
PPT (Upload PPT)