1 paper · 1 filter
Dan Garber, Ben Kretzu
We consider the setting of online convex optimization with adversarial time-varying constraints in which actions must be feasible w.r.t. a fixed constraint set, and are also requir…