Faster Rates for No-Regret Learning in General Games via Cautious Optimism

Ashkan Soleymani, Georgios Piliouras, Gabriele Farina

We establish the first uncoupled learning algorithm that attains $O(n{\log }^{2}d\log T)$ per-player regret in multi-player general-sum games, where $n$ is the number of players, $d$…