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

用于线性二次平均场博弈的两种系统变换数据驱动算法

Two system transformation data-driven algorithms for linear quadratic mean-field games

Xun Li, Guangchen Wang, Yu Wang, Jie Xiong, Heng Zhang

AI总结:

针对连续时间线性二次平均场博弈,提出两种经系统变换、无需系统矩阵的数据驱动PI与VI算法,并证明收敛性和通过数值算例验证实用性。

摘要:

本文研究一类连续时间线性二次(LQ)平均场博弈问题。我们开发了两种系统变换数据驱动算法,用于近似LQ平均场博弈的去中心化策略。所得数据驱动算法的主要特点是它们消除了对所有系统矩阵的需求。首先,我们将原始随机系统变换为一个常微分方程(ODE)。随后,我们利用该ODE的输入/状态数据构造一些基于Kronecker积的矩阵。借助这些矩阵,我们以数据驱动的方式实现基于模型的策略迭代(PI)算法和基于模型的值迭代(VI)算法。此外,我们还在一些温和条件下证明了这两种数据驱动算法的收敛性。最后,我们通过两个数值算例说明了所提算法的实用性。

英文摘要:

This paper studies a class of continuous-time linear quadratic (LQ) mean-field game problems. We develop two system transformation data-driven algorithms to approximate the decentralized strategies of the LQ mean-field games. The main feature of the obtained data-driven algorithms is that they eliminate the requirement on all system matrices. First, we transform the original stochastic system into an ordinary differential equation (ODE). Subsequently, we construct some Kronecker product-based matrices by the input/state data of the ODE. By virtue of these matrices, we implement a model-based policy iteration (PI) algorithm and a model-based value iteration (VI) algorithm in a data-driven fashion. In addition, we also demonstrate the convergence of these two data-driven algorithms under some mild conditions. Finally, we illustrate the practicality of our algorithms via two numerical examples.

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

↑