通信受限的双网络零和博弈分布式在线优化

研究双网络零和博弈中的分布式优化问题，其中两个网络代表两个对立的玩家。每个网络由一组具有时变损失函数的智能体组成，智能体通过通信和协作来优化己方网络在博弈中的收益。考虑到现实优化场景中通信资源受限和信息反馈受限两种通信受限情形，设计基于事件触发通信和两点Bandit反馈的分布式在线优化算法，并采用动态纳什均衡遗憾评估算法的性能。在某些假设条件下，建立相对于总博弈次数为次线性的动态纳什均衡遗憾界，从而验证了算法的有效性。此外，将设计的算法拓展为多周期版本并建立次线性的动态纳什均衡遗憾界。最后，通过双线性矩阵博弈的仿真算例进一步验证了所设计的两个算法的性能。

This paper investigates the distributed optimization problem in two-network zero-sum games, where the two networks represent two opposing players. Each network consists of a set of agents with time-varying cost functions, and the agents optimize the payoff of their network in the game through communication and collaboration. Considering the two communication constrained situations in real optimization scenarios, namely, limited communication resources and limited information feedback, a distributed online optimization algorithm based on event-triggered communication and two-point Bandit feedback is designed, and the performance of the algorithm is evaluated using the dynamic Nash equilibrium regret. Under certain assumptions, a sublinear dynamic Nash equilibrium regret bound relative to the total number of game iterations is established, thereby validating the effectiveness of the algorithm. Additionally, the designed algorithm is extended to a multi-epoch version, and a sublinear dynamic Nash equilibrium regret bound is also established. Finally, a simulation example involving a bilinear matrix game is provided to further verify the performance of the two designed algorithms.