REVIEW 3 cited by
On Finding Local Nash Equilibria (and Only Local Nash Equilibria) in Zero-Sum Games
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We propose local symplectic surgery, a two-timescale procedure for finding local Nash equilibria in two-player zero-sum games. We first show that previous gradient-based algorithms cannot guarantee convergence to local Nash equilibria due to the existence of non-Nash stationary points. By taking advantage of the differential structure of the game, we construct an algorithm for which the local Nash equilibria are the only attracting fixed points. We also show that the algorithm exhibits no oscillatory behaviors in neighborhoods of equilibria and show that it has the same per-iteration complexity as other recently proposed algorithms. We conclude by validating the algorithm on two numerical examples: a toy example with multiple Nash equilibria and a non-Nash equilibrium, and the training of a small generative adversarial network (GAN).
Forward citations
Cited by 3 Pith papers
-
On the convergence of single-call stochastic extra-gradient methods
Single-call stochastic extra-gradient methods achieve O(1/t) ergodic convergence in deterministic monotone variational inequalities and O(1/t) last-iterate local convergence around regular solutions in stochastic non-...
-
The Monge optimal transport barycenter problem
A new flow-based algorithm solves the data-driven Monge optimal transport barycenter problem by recasting the independence constraint as a singular-value penalty, yielding linear per-iteration cost and a closed-form m...
-
Solving Infinite-Player Games with Player-to-Strategy Networks
A Player-to-Strategy Network trained with Shared-Parameter Simultaneous Gradient achieves low regret approximate Nash equilibria in five infinite-player games.
Discussion (0). Continue with ORCID to comment.