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

二阶势平均场博弈的一种网格无关方法

A mesh-independent method for second-order potential mean field games

Kang Liu, Laurent Pfeiffer

AI总结:

本文研究广义Frank-Wolfe算法求解二阶势平均场博弈的收敛性,证明在theta格式离散下,两种步长选择分别具有次线性和线性收敛速率,且收敛常数与离散化参数无关。

摘要:

本文研究广义Frank-Wolfe(GFW)算法在求解势二阶与凸二阶平均场博弈时的收敛性。具体而言,分析了平均场博弈系统离散化对GFW算法有效性的影响。文章聚焦于作者在先前研究中提出的theta格式。针对两种不同的步长选择,分别获得了次线性收敛速率和线性收敛速率。这些速率具有网格无关性质:其底层收敛常数与离散化参数无关。

英文摘要:

This article investigates the convergence of the Generalized Frank-Wolfe (GFW) algorithm for the resolution of potential and convex second-order mean field games. More specifically, the impact of the discretization of the mean-field-game system on the effectiveness of the GFW algorithm is analyzed. The article focuses on the theta-scheme introduced by the authors in a previous study. A sublinear and a linear rate of convergence are obtained, for two different choices of stepsizes. These rates have the mesh-independence property: the underlying convergence constants are independent of the discretization parameters.

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

↑