A standard distributed gradient play algorithm achieves geometric convergence to Nash equilibrium in strongly monotone games with unconstrained actions over networks, using a single step size and outperforming prior GRANE method.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Geometric Convergence of Distributed Gradient Play in Games with Unconstrained Action Sets
A standard distributed gradient play algorithm achieves geometric convergence to Nash equilibrium in strongly monotone games with unconstrained actions over networks, using a single step size and outperforming prior GRANE method.