arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.05294math.OC
收藏

均场博弈与在大规模扩张图上的控制

Mean Field Games and Control on Large Expander Graphs

McGill University(麦吉尔大学)

Tao Zhang, Peter E. Caines

AI总结:

本文研究了稀疏网络上的均场博弈与控制,在大规模扩张图中,利用graphexon框架分析极限拓扑,证明了有限图上的经验graphexon测度序列弱收敛到连续状态空间上的极限graphexon测度,并建立了离散平均算子序列强收敛到连续算子的性质,从而构建了线性二次均场博弈模型。

摘要:

本文研究了稀疏网络上的均场博弈与控制。在大规模扩张图中,利用graphexon框架分析极限拓扑,该框架同时刻画了密集网络极限和稀疏连接。我们证明了定义在有限图上的经验graphexon测度序列弱收敛到连续状态空间上的极限graphexon测度。此外,相关的离散平均算子序列强收敛到连续算子。这些性质使得可以构建一个线性二次均场博弈,其中每个代理由空间网络标签α∈X标识,并仅与由算子G定义的邻域平均交互,该算子由大规模扩张图特征化。在第5节中,建立了闭环系统的全局渐近稳定的代数条件。分析确定了参数阈值,导致Turing型拓扑不稳定性,其中均质均值状态保持稳定,而空间偏差场在极限算子的连续谱上发散。

英文摘要:

This paper investigates mean field games on sparse networks. In the case of large expander graphs, the limit topologies are analyzed using the graphexon framework, which characterizes sparse connections. We prove that the associated sequence of discrete averaging operators converges strongly to a continuous operator and this is illustrated in the development of infinite limits of Gabber-Galil-Margulis expander graphs \cite{gabber1981explicit}. These properties enable the formulation and existence proof of equilibria for linear-quadratic mean field games in which each agent is identified by a spatial network label $α\in X$ and only interacts with the neighborhood average characterized by the operator $\mathcal{G}$, i.e., the average state of a limited number of connected neighbors in a large expander graph. Furthermore, algebraic conditions induced by the spectral gap of $\mathcal{G}$ for the global asymptotic stability of the closed-loop system are established, and parameter thresholds that give rise to a Turing-type topological instability are established.

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

↑