arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1708.08343math.OCcs.NAmath.NA
收藏

一种基于马尔可夫链近似方法的均场博弈数值方案(某些排队系统)

A numerical scheme for a mean field game in some queueing systems based on Markov chain approximation method

Erhan Bayraktar, Amarjit Budhiraja, Asaf Cohen

AI总结:

本文提出一种基于马尔可夫链近似方法的均场博弈数值方案,用于解决具有反射边界条件的均场博弈问题,并证明该方案在小时间区间内的收敛性。

摘要:

我们使用马尔可夫链近似方法来构造解于具有反射边界的均场博弈(MFG)的近似解,该MFG是在Bayraktar、Budhiraja和Cohen(2017)中研究的。MFG以受控反射扩散过程的形式建立,其成本函数不仅依赖于标准变量:状态、控制和均场项,还依赖于反射项。该MFG来源于单服务器队列N-player游戏的渐近分析。通过证明我们的方案是几乎收缩的,我们建立了该数值方案在小时间区间内的收敛性。

英文摘要:

We use the Markov chain approximation method to construct approximations for the solution of the mean field game (MFG) with reflecting barriers studied in Bayraktar, Budhiraja, and Cohen (2017). The MFG is formulated in terms of a controlled reflected diffusion with a cost function that depends on the reflection terms in addition to the standard variables: state, control, and the mean field term. This MFG arises from the asymptotic analysis of an $N$-player game for single server queues with strategic servers. By showing that our scheme is an almost contraction, we establish the convergence of this numerical scheme over a small time interval.

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

↑