A New Benchmark for Online Learning with Budget-Balancing Constraints

Mark Braverman, Jingyi Liu, Jieming Mao +2

The adversarial Bandit with Knapsack problem is a multi-armed bandits problem with budget constraints and adversarial rewards and costs. In each round, a learner selects an action…