Online Learning with Vector Costs and Bandits with Knapsacks

Thomas Kesselheim, Sahil Singla

We introduce online learning with vector costs (\OLVCp) where in each time step $t\in \{1,\dots ,T\}$, we need to play an action $i\in \{1,\dots ,n\}$ that incurs an unknown vec…