This paper is concerned with distributed dynamic event-triggered Nash equilibrium seeking in merely monotone games under switching communication topologies. Based on a regularization algorithm, a gradient play and a leader-following consensus protocol, a distributed Nash equilibrium seeking strategy incorporating an event- and switching-activated communication scheme is established. More specifically, the regularization algorithm is involved to compensate for the absence of strict/strong monotonicity of game mapping and the gradient play is utilized to optimize players' objectives. The event-triggered leader-following consensus protocol is introduced to achieve distributed estimation of all players' actions, where communication transmissions among neighbors occur only when the preset event-triggering conditions are satisfied and communication topologies are switching. It is shown that the proposed seeking strategy can asymptotically steer players' actions to the least-norm Nash equilibrium of merely monotone games with reduced communication resources. An illustrative example on least-distance formation control for a network of unicycle-type mobile vehicles is given to validate the effectiveness of the proposed method.

中文翻译：

---

使用事件和切换激活的通信方案在纯单调游戏中寻求分布式纳什均衡


本文关注的是切换通信拓扑下的单调博弈中的分布式动态事件触发纳什均衡寻求。基于正则化算法、梯度游戏和领导者跟随共识协议，建立了结合事件和切换激活通信方案的分布式纳什均衡寻求策略。更具体地说，涉及正则化算法来补偿游戏映射的严格/强单调性的缺乏，并且利用梯度游戏来优化玩家的目标。引入事件触发的领导者跟随共识协议来实现对所有参与者行为的分布式估计，其中只有当满足预设的事件触发条件并且通信拓扑发生切换时，邻居之间的通信传输才会发生。结果表明，所提出的寻求策略可以渐近地将玩家的行为引导至通信资源减少的单调博弈的最小范数纳什均衡。给出了独轮车网络最短距离编队控制的示例，验证了所提方法的有效性。