In this paper, we study multi-agent network games subject to affine time-varying coupling constraints and a time-varying communication network. We focus on the class of games adopting proximal dynamics and study their convergence to a persistent equilibrium. The assumptions considered to solve the problem are discussed and motivated. We develop an iterative equilibrium seeking algorithm, using only local information, that converges to a special class of game equilibria. Its derivation is motivated by several examples, showing that the original game dynamics fail to converge. Finally, we apply the designed algorithm to solve a constrained consensus problem, illustrating the theoretical results.
|Title of host publication||Proceedings of the European Control Conference 2020, ECC 2020|
|Place of Publication||Piscataway, NJ, USA|
|Publication status||Published - 2020|
|Event||18th European Control Conference, ECC 2020 - Saint Petersburg, Russian Federation|
Duration: 12 May 2020 → 15 May 2020
|Conference||18th European Control Conference, ECC 2020|
|Period||12/05/20 → 15/05/20|