Distributed Nash Equilibrium Seeking Over Markovian Switching Communication Networks.

Abstract

We aim to address the Nash equilibrium (NE) seeking problem for multiple players over Markovian switching communication networks in this article, where a new type of distributed synchronous discrete-time algorithm is proposed and utilized. Specifically, each player in the present game model is assumed to employ a gradient-like projection algorithm to choose its action based upon the estimated ones for all the others. Under the mild condition that the union network of all communication network candidates is connected, we show that the players' actions could converge to an arbitrarily small neighborhood of the NE in the mean-square sense by adjusting the algorithm parameters. It is further found that the unique NE is mean-square stable when it is not restricted by any constraint set. In addition, we show that the proposed distributed discrete-time NE seeking algorithm can be utilized to deal with the energy trading problem in microgrids where each microgrid is modeled as a rational player using a purchase price as its action to buy energy from other microgrids with surplus supplies. The energy market allocates the excess energy according to the principle of proportional distribution. Some numerical simulations are finally presented to verify the validity of the present discrete-time NE seeking algorithm in solving the energy trading problem.