2 papers
cs.LG2024
An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems
Sarah Sachs, Hedi Hadiji, Tim van Erven +1
We consider a repeatedly played generalized Nash equilibrium game. This induces a multi-agent online learning problem with joint constraints. An important challenge in this setting…
cs.LG2021
Robust Online Convex Optimization in the Presence of Outliers
Tim van Erven, Sarah Sachs, Wouter M. Koolen +1
We consider online convex optimization when a number k of data points are outliers that may be corrupted. We model this by introducing the notion of robust regret, which measures t…