1 citations · 1 across the 4 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Linear Last-Iterate Convergence Rates for Optimistic Learning in Harmonic Games
John Lazarsfeld, Anas Barakat, Jacob Abernethy +4
We prove that the last iterate of Optimistic Follow-The-Regularized-Leader (OFTRL) converges at a linear rate to a Nash equilibrium in multiplayer harmonic games. Our result holds…
cs.GT2026
Arbitrarily Slow Polynomial Convergence of Fictitious Play
Jacob Abernethy, John Lazarsfeld, Andre Wibisono
We show that fictitious play can converge at arbitrarily slow polynomial rates in two-player zero-sum games. For every integer , we construct a payoff matrix with $(k+1)^2…