Communications in Information and Systems

Volume 21 (2021)

Number 3

Linear quadratic graphon field games

Pages: 341 – 369

DOI: https://dx.doi.org/10.4310/CIS.2021.v21.n3.a2

Authors

Shuang Gao (Department of Electrical and Computer Engineering, McGill University, Montreal, Quebec, Canada)

Rinel Foguen Tchuendom (Department of Electrical and Computer Engineering, McGill University, Montreal, Quebec, Canada)

Peter E. Caines (Department of Electrical and Computer Engineering, McGill University, Montreal, Quebec, Canada)

Abstract

Linear quadratic graphon field games (LQ-GFGs) are defined to be linear quadratic games which involve a large number of agents that are weakly coupled via a weighted undirected graph on which each node represents an agent. The links of the graph correspond to couplings between the agents’ dynamics, as well as between the individual cost functions, which each agent attempts to minimize.We formulate limit LQ-GFG problems based on the assumption that these graphs lie in a sequence which converges to a limit graphon. First, under a finite-rank assumption on the limit graphon, the existence and uniqueness of solutions to the formulated limit LQ-GFG problem is established. Second, based upon the solutions to the limit LQ-GFG problem, $\varepsilon$-Nash equilibria are constructed for the corresponding game problems with a very large but finite number of players. This result is then generalized to the case with random initial conditions. It is to be noted that LQ-GFG problems are distinct from the class of graphon mean field game (GMFG) problems where a population is hypothesized to be associated with each node of the graph [6, 7].

The full text of this article is unavailable through your IP address: 3.236.121.117

This work was supported in part by NSERC Grant 2019-05336 (Canada), U.S. ARL and ARO Grant W911NF1910110, and U.S. AFOSR Grant FA9550-19-1-0138.

Received 29 May 2020

Published 4 June 2021