2000 character limit reached
Stationary Cost Nodes in Infinite Horizon LQG-GMFGs (2207.11343v1)
Published 22 Jul 2022 in eess.SY and cs.SY
Abstract: An analysis of infinite horizon linear quadratic Gaussian (LQG) Mean Field Games is given within the general framework of Graphon Mean Field Games (GMFG) on dense infinite graphs (or networks) introduced in Caines and Huang (2018). For a class of LQG-GMFGs, analytical expressions are derived for the infinite horizon Nash values at the nodes of the infinite graph. Furthermore, under specific conditions on the network and the initial population means, it is shown that the nodes with strict local maximal infinite network degree are also nodes with strict local minimal cost at equilibrium.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.