Linear programming fictitious play algorithm for mean field games with optimal stopping and absorption

Roxana Dumitrescu, Marcos Leutscher, P. Tankov
{"title":"Linear programming fictitious play algorithm for mean field games with optimal stopping and absorption","authors":"Roxana Dumitrescu, Marcos Leutscher, P. Tankov","doi":"10.1051/m2an/2023019","DOIUrl":null,"url":null,"abstract":"We develop the fictitious play algorithm in the context of the linear programming approach for mean field games of optimal stopping and mean field games with regular control and absorption. This algorithm allows to approximate the mean field game population dynamics without computing the value function by solving linear programming problems associated with the distributions of the players still in the game and their stopping times/controls. We show the convergence of the algorithm using the topology of convergence in measure in the space of subprobability measures, which is needed to deal with the lack of continuity of the flows of measures. Numerical examples are provided to illustrate the convergence of the algorithm.","PeriodicalId":50499,"journal":{"name":"Esaim-Mathematical Modelling and Numerical Analysis-Modelisation Mathematique et Analyse Numerique","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2022-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Esaim-Mathematical Modelling and Numerical Analysis-Modelisation Mathematique et Analyse Numerique","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1051/m2an/2023019","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 8

Abstract

We develop the fictitious play algorithm in the context of the linear programming approach for mean field games of optimal stopping and mean field games with regular control and absorption. This algorithm allows to approximate the mean field game population dynamics without computing the value function by solving linear programming problems associated with the distributions of the players still in the game and their stopping times/controls. We show the convergence of the algorithm using the topology of convergence in measure in the space of subprobability measures, which is needed to deal with the lack of continuity of the flows of measures. Numerical examples are provided to illustrate the convergence of the algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有最优停止和吸收的平均场博弈的线性规划虚拟博弈算法
在线性规划方法的背景下,我们开发了具有最优停止和具有规则控制和吸收的平均场博弈的虚拟博弈算法。该算法允许通过解决与仍在游戏中的玩家分布及其停止时间/控制相关的线性规划问题来计算价值函数,而无需计算平均场游戏人口动态。我们利用子概率测度空间中的测度收敛拓扑来证明算法的收敛性,这是处理测度流缺乏连续性所需要的。数值算例说明了该算法的收敛性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.70
自引率
5.30%
发文量
27
审稿时长
6-12 weeks
期刊介绍: M2AN publishes original research papers of high scientific quality in two areas: Mathematical Modelling, and Numerical Analysis. Mathematical Modelling comprises the development and study of a mathematical formulation of a problem. Numerical Analysis comprises the formulation and study of a numerical approximation or solution approach to a mathematically formulated problem. Papers should be of interest to researchers and practitioners that value both rigorous theoretical analysis and solid evidence of computational relevance.
期刊最新文献
The nonconforming virtual element method for Oseen’s equation using a stream-function formulation A second-order absorbing boundary condition for two-dimensional peridynamics On the convergence of an IEQ-based first-order semi-discrete scheme for the Beris-Edwards system A virtual element method for overcoming locking phenomena in Biot's consolidation model On strictly convex entropy functions for the reactive Euler equations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1