Fast swap regret minimization and applications to approximate correlated equilibria

Binghui Peng, Aviad Rubinstein

We give a simple and computationally efficient algorithm that, for any constant $\epsilon >0$, obtains $\epsilon T$-swap regret within only $T=\mathsf{polylog}(n)$ rounds; t…