arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.03578math.OC
收藏

多集群博弈中的分布式在线广义纳什均衡学习:一种容忍延迟的算法

Distributed online generalized Nash Equilibrium learning in multi-cluster games: A delay-tolerant algorithm

Bingqian Liu, Guanghui Wen, Xiao Fang, Tingwen Huang, Guanrong Chen

AI总结:

本文针对多集群博弈中反馈信息存在时变延迟且智能体仅能获取部分决策信息的问题,提出一种基于原始-对偶和聚合梯度机制的分布式在线容忍延迟GNE学习算法,并证明其遗憾和约束违反随时间次线性增长。

摘要:

本文研究具有延迟反馈信息的多集群博弈中分布式在线广义纳什均衡(GNE)学习问题。具体而言,博弈中的每个智能体被假定在每轮决策之后获知一系列局部成本函数和约束函数,这些函数以时变延迟的形式为智能体所知。每个集群内智能体的目标是在时变耦合不等式约束和局部可行集约束下,协同优化该集群的成本函数。此外,假设每个智能体需要通过与其邻居的交互来估计所有其他智能体的决策,而不能直接获取所有智能体的决策,即每个智能体需要在部分决策信息条件下做出决策。为解决这一具有挑战性的问题,本文基于原始-对偶算法和聚合梯度机制,开发了一种新颖的分布式在线容忍延迟GNE学习算法。文中构建了系统级遗憾和约束违反量来衡量算法性能,证明其在特定条件下随时间呈次线性增长。最后,给出数值结果以验证所提算法的有效性。

英文摘要:

This paper addresses the problem of distributed online generalized Nash equilibrium (GNE) learning for multi-cluster games with delayed feedback information. Specifically, each agent in the game is assumed to be informed a sequence of local cost functions and constraint functions, which are known to the agent with time-varying delays subsequent to decision-making at each round. The objective of each agent within a cluster is to collaboratively optimize the cluster's cost function, subject to time-varying coupled inequality constraints and local feasible set constraints over time. Additionally, it is assumed that each agent is required to estimate the decisions of all other agents through interactions with its neighbors, rather than directly accessing the decisions of all agents, i.e., each agent needs to make decision under partial-decision information. To solve such a challenging problem, a novel distributed online delay-tolerant GNE learning algorithm is developed based upon the primal-dual algorithm with an aggregation gradient mechanism. The system-wise regret and the constraint violation are formulated to measure the performance of the algorithm, demonstrating sublinear growth with respect to time under certain conditions. Finally, numerical results are presented to verify the effectiveness of the proposed algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑