A Numerical Scheme for a Mean Field Game in Some Queueing Systems Based on Markov Chain Approximation Method

From MaRDI portal
Publication:4554792

DOI10.1137/17M1154357;zbMATH Open1425.91043arXiv1708.08343MaRDI QIDQ4554792FDOQ4554792

Erhan Bayraktar, Asaf Cohen, Amarjit Budhiraja

Publication date: 9 November 2018

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1708.08343





Cites Work


Cited In (8)






This page was built for publication: A Numerical Scheme for a Mean Field Game in Some Queueing Systems Based on Markov Chain Approximation Method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554792)