A distributed event-triggered generalized Nash equilibrium seeking algorithm

Distributed adaptive generalized Nash equilibrium seeking algorithm with event‐triggered communication

“…Remark The main differences between this paper and Reference 18 are two points. One is the adaptive variables introduced in () and () to remove the requirement of the graph information, which is needed in the work of Cai et al [16]. The other is directed graphs assumed in this paper, which is an extension of undirected graphs considered in the work of Cai et al [16].…”

“…In recent years, distributed GNE seeking algorithms (or strategy-updating rules) have been studied for aggregative games from the perspective of agents' dynamics, communication topologies and convergence performance. Besides single-integrator systems, which were extensively studied in the previous studies [12,15,16,30], disturbed single/double integrators and Euler-Lagrange systems were also considered in aggregative games [11,[16][17][18][19]. Communication topologies for information exchange have been generalized from fixed undirected graphs to more flexible ones, such as weight-balanced and unbalanced digraphs, and time varying graphs [7,[20][21][22][23][24].…”

Distributed generalized Nash equilibrium seeking for noncooperative games with unknown cost functions

“…The convergence of the most distributed GNE seeking algorithms requires some information of communication networks, which is removed by introducing adaptive gains 29 . Taken the communication cost and efficiency into account, event‐triggered communication schemes were proposed to reduce communication loads in distributed continuous‐time seeking algorithms 30,31 …”

“…29 Taken the communication cost and efficiency into account, event-triggered communication schemes were proposed to reduce communication loads in distributed continuous-time seeking algorithms. 30,31 It is worth noting that the above-mentioned work requires the exact information of the model, that is, the specifically expressed cost functions and constraints, and the strategies of other players. However, in some practical engineering systems, there exist unknown cost functions, constraints and other parameters in games, such as unknown price functions in energy markets, 32 the power function without explicit aerodynamic interactions in the wind turbine, 33 unknown traffic demands/constraints in the network routing, 34 and unknown position information and/or environmental conditions in mobile sensor networks.…”