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

关于具有离散初始数据的一阶均场博弈模型问题

A Model Problem for First Order Mean Field Games with Discrete Initial Data

Baylor University(贝勒大学)

P. Jameson Graber, Brady Zimmerman

AI总结:

本文提出了一种具有离散初始数据的一阶均场博弈模型,通过牛顿法求解并展示了密度惩罚对初始分布平滑化的影响。

摘要:

本文研究了一种简化的密度依赖性一阶均场博弈模型,在此模型中,玩家面临的惩罚等于他们在最终位置的人口密度。我们考虑了当初始分布为离散测度时寻找均衡的问题。我们证明该问题成为有限维问题:最终的分段光滑密度完全由初始测度的权重和位置决定。我们利用经典的不动点定理建立了解的存在性和唯一性。最后,我们证明牛顿法提供了一种有效计算解的方法。我们的数值模拟展示了均场博弈中密度惩罚如何使初始分布趋于平滑。

英文摘要:

In this article, we study a simplified version of a density-dependent first-order mean field game, in which the players face a penalization equal to the population density at their final position. We consider the problem of finding an equilibrium when the initial distribution is a discrete measure. We show that the problem becomes finite-dimensional: the final piecewise smooth density is completely determined by the weights and positions of the initial measure. We establish existence and uniqueness of a solution using classical fixed point theorems. Finally, we show that Newton's method provides an effective way to compute the solution. Our numerical simulations provide an illustration of how density penalization in a mean field game tends to the smoothen the initial distribution.

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

↑