… Compared with [32]–[35], the communication topology graph considered in this article is
directed, and the communication topology switches between a group of jointly connected …

… under switching communication topologies. The objective of this paper is to tackle distributed
Nash equilibrium seeking under switching directed communication topologies, each of …

… Nash equilibrium point is guaranteed. For the latter case, we indicate, by simulations, that
practical scenarios tend to admit a Nash equilibrium… admit at least one Nash equilibrium that is …

… Consequently, the interaction topology of the system is generated from players' strategies. …
interaction topology decided by Nash equilibrium of the game as the equilibrium topology of …

… game over fixed communication topology, by estimating the left eigenvector of the topology-…
behavior of all players caused by such a topology-dependent row-stochastic matrix is …

… communication-efficient distributed Nash equilibrium seeking in networked games with directed
and switching communication topologies… efficient utilization of communication resources. …

… To the best of our knowledge, switching communication topologies have only been
addressed with diminishing step sizes. For instance, the early work [10] considered aggregative …

… of the noncooperative game, distributed Nash equilibrium (NE) … the players need only to
communicate with their neighbors to … as long as the communication topology of players was …

… • In some of the considered cases we show that, similarly to [10], Nash equilibria are obtained
in very simple topologies, such as a complete graph (clique) or a ring. • Moreover, when …

… For instance, time-varying communication topologies with quantizers were addressed for
the distributed iterative averaging problem [18]. In [19], quantization effects on the performance …