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

大规模稀疏图上的随机游戏

Stochastic Games on Large Sparse Graphs

Imperial College London(帝国理工学院)

Eyal Neuman, Sturmius Tuschmann

AI总结:

本文提出了一种大规模稀疏图上随机游戏的框架,研究了纳什均衡的存在性、唯一性和收敛性,以及通过局部弱收敛图序列的近似与重建方法。

摘要:

我们介绍了一个框架,用于研究大规模稀疏图上的随机游戏,涵盖了连续时间和离散时间动态博弈以及静态博弈。玩家由简单、局部有限图的顶点索引,允许有限和可数无限的人口,通过标记图的局部弱收敛来描述渐近性。该框架允许路径依赖的效用函数,这些函数可能在不同玩家之间异质。在收缩条件下,我们证明了纳什均衡的存在性和唯一性,并建立了与图距离相关的指数衰减相关性。我们进一步表明,全局均衡可以被截断的局部游戏近似,并且在给定边界信息的情况下,可以在子图上精确重建。最后,我们证明了沿局部弱收敛图序列的纳什均衡收敛性,包括从超有限单模随机图中采样的序列。

英文摘要:

We introduce a framework for stochastic games on large sparse graphs, covering continuous-time and discrete-time dynamic games as well as static games. Players are indexed by the vertices of simple, locally finite graphs, allowing both finite and countably infinite populations, with asymptotics described through local weak convergence of marked graphs. The framework allows path-dependent utility functionals that may be heterogeneous across players. Under a contraction condition, we prove existence and uniqueness of Nash equilibria and establish exponential decay of correlations with graph distance. We further show that global equilibria can be approximated by truncated local games, and can even be reconstructed exactly on subgraphs given information on their boundary. Finally, we prove convergence of Nash equilibria along locally weakly convergent graph sequences, including sequences sampled from hyperfinite unimodular random graphs.

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

↑