Tracking-based distributed equilibrium seeking for aggregative games
share
We propose fully-distributed algorithms for Nash equilibrium seeking in aggregative games over networks. We first consider the case where only local constraints are present and we design an algorithm combining, for each agent, (i) the projected pseudo-gradient descent and (ii) a tracking mechanism to locally reconstruct the aggregative variable. To handle coupling constraints arising in generalized settings, we propose another distributed algorithm based on (i) a recently emerged augmented primal-dual scheme and (ii) two tracking mechanisms to reconstruct, for each agent, both the aggregative variable and the coupling constraint satisfaction. Leveraging tools from singular perturbations analysis, we prove linear convergence to the Nash equilibrium for both schemes. Finally, we run extensive numerical simulations to confirm the effectiveness of our methods, also showing that they outperform the current state-of-the-art distributed equilibrium seeking algorithms.
READ FULL TEXT
