A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming

Haoran Xu, Owen Shen, Peter Glynn +2

We study nonstationary Online Linear Programming (OLP), where $n$ orders arrive sequentially with reward-resource consumption pairs that form a sequence of independent, but not nec…