Asynchronous and time-varying proximal type dynamics multi-agent network games

Abstract

In this paper, we study proximal type dynamics in the context of noncooperative multi-agent network games. These dynamics arise in different applications, since they describe distributed decision making in multi-agent networks, e.g., in opinion dynamics, distributed model fitting and network information fusion, where the goal of each agent is to seek an equilibrium using local information only. We analyse several conjugations of this class of games, providing convergence results, or designing equilibrium seeking algorithms when the original dynamics fail to converge. For the games subject only to local constraints we look into both synchronous/asynchronous dynamics and time-varying communication networks. For games subject in addition to coupling constraints, we design an equilibrium seeking algorithm converging to a special class of game equilibria. Finally, we validate the theoretical results via numerical simulations on opinion dynamics and distributed model fitting.