Alternating gradient descent energy invariants can be turned into linear equations that recover the Nash equilibrium in O(k) iterations, provided the equation system is non-degenerate.
Zero-sum polymatrix games: A generalization of minmax
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries
Alternating gradient descent energy invariants can be turned into linear equations that recover the Nash equilibrium in O(k) iterations, provided the equation system is non-degenerate.