A distributed extrapolation algorithm achieves geometric convergence O(exp{-k/(gamma^2 n^2)}) in restricted strongly monotone games and the first sublinear rate O(1/k^{1/2-epsilon}) for merely monotone games.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast Distributed Nash Equilibrium Seeking in Monotone Games
A distributed extrapolation algorithm achieves geometric convergence O(exp{-k/(gamma^2 n^2)}) in restricted strongly monotone games and the first sublinear rate O(1/k^{1/2-epsilon}) for merely monotone games.