Fast Swap Regret Minimization and Applications to Approximate Correlated Equilibria
Abstract: We give a simple and computationally efficient algorithm that, for any constant \eps>0, obtains εT distributional swap regret within only T = polylog(n) rounds;…