Barriers to Achieving Near-Optimal Welfare with No-Regret Learning in Two-Player Games

Achieving near-optimal welfare using no-regret learning in two-player games requires a number of iterations that is computationally prohibitive, even when players can fully coordinate their strategies.