LQG Graphon Mean Field Games: Analysis via Graphon Invariant Subspaces

2020/04/01 by Gao, Shuang, Caines, Peter E., Huang, Minyi · 1 citation
#FOS: Electrical engineering #FOS: Mathematics #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · doi:10.48550/arxiv.2004.00679

Abstract

This paper studies approximate solutions to large-scale linear quadratic stochastic games with homogeneous nodal dynamics parameters and heterogeneous network couplings within the graphon mean field game framework in [2]-[4]. A graphon time-varying dynamical system model is first formulated to study the finite and then limit problems of linear quadratic Gaussian graphon mean field games (LQG-GMFG). The Nash equilibrium of the limit problem is then characterized by two coupled graphon time-varying dynamical systems. Sufficient conditions are established for the existence of a unique solution to the limit LQG-GMFG problem. For the computation of LQG-GMFG solutions two methods are established and employed where one is based on fixed point iterations and the other on a decoupling operator Riccati equation; furthermore, two corresponding sets of solutions are established based on spectral decompositions. Finally, a set of numerical simulations on networks associated with different types of graphons are presented.

Cited by

• An Overview of Some Extensions of Mean Field Games beyond Perfect Homogeneity and Anonymity

Related

• Linear-Quadratic Graphon Mean Field Games with Common Noise
• Learning Graphon Mean Field Games and Approximate Nash Equilibria
• Stochastic Graphon Games with Jumps and Approximate Nash Equilibria
• Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithm
• A label-state formulation of stochastic graphon games and approximate equilibria on large networks