Bandits with Knapsacks beyond the Worst Case.
Karthik Abinav SankararamanAleksandrs SlivkinsPublished in: NeurIPS (2021)
Keyphrases
- worst case
- knapsack problem
- average case
- np hard
- upper bound
- greedy algorithm
- lower bound
- approximation algorithms
- error bounds
- stochastic systems
- worst case analysis
- database systems
- computational complexity
- theoretical guarantees
- online algorithms
- running times
- times faster
- multi class
- digital libraries
- space complexity
- multi agent systems