Almost Greedy Fictitious Play achieves an instance-dependent O(1/T) convergence rate to Nash equilibrium in zero-sum games by optimizing stepsizes without discretization.
(doubly) exponential lower bounds for follow the regularized leader in potential games.arXiv preprint arXiv:2601.23248,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Do Not Discretize, Optimize: Almost Greedy Fictitious Play
Almost Greedy Fictitious Play achieves an instance-dependent O(1/T) convergence rate to Nash equilibrium in zero-sum games by optimizing stepsizes without discretization.