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

平均场和稀疏域中大图上随机对策的一个实例研究

A case study on stochastic games on large graphs in mean field and sparse regimes

Daniel Lacker, Agathe Soret

摘要:

研究了一类线性二次随机微分对策,其中每个局中人只与给定图中的最近邻直接交互。我们发现一个半显式的马尔可夫平衡的任何传递图,在经验特征值分布的图形的规范化拉普拉斯矩阵。这有利于大人口渐近的各种图序列,与几个稀疏和密集的例子详细讨论。特别地,平均场博弈仅在稠密图的情况下是正确的极限,即,当度数在适当的意义上发散时。即使均衡策略是非局部的,根据所有玩家的行为,我们使用相关衰减估计证明了混沌的传播结果在密集和稀疏的制度,与稀疏的情况下,由于典型的顶点之间的距离很大。在不假设图是可传递的情况下,我们还证明了平均场博弈解可以用于在任何足够密集的图序列上构造分散的近似均衡。

英文摘要:

We study a class of linear-quadratic stochastic differential games in which each player interacts directly only with its nearest neighbors in a given graph. We find a semi-explicit Markovian equilibrium for any transitive graph, in terms of the empirical eigenvalue distribution of the graph's normalized Laplacian matrix. This facilitates large-population asymptotics for various graph sequences, with several sparse and dense examples discussed in detail. In particular, the mean field game is the correct limit only in the dense graph case, i.e., when the degrees diverge in a suitable sense. Even though equilibrium strategies are nonlocal, depending on the behavior of all players, we use a correlation decay estimate to prove a propagation of chaos result in both the dense and sparse regimes, with the sparse case owing to the large distances between typical vertices. Without assuming the graphs are transitive, we show also that the mean field game solution can be used to construct decentralized approximate equilibria on any sufficiently dense graph sequence.

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

↑