Linear Quadratic Graphon Field Games
Linear quadratic graphon field games (LQ-GFGs) are defined to be LQ 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, epsilon-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 [Caines and Huang CDC 2018, 2019].
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
LQG Graphon Mean Field Games: Analysis via Graphon Invariant Subspaces
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]…
Policy Optimization for Continuous-time Linear-Quadratic Graphon Mean Field Games
Multi-agent reinforcement learning, despite its popularity and empirical success, faces significant scalability challenges in large-population dynamic games. Graphon mean field games (GMFGs) offer a principled framework …
Bilevel OptimizationMulti-agent Reinforcement LearningStationary Cost Nodes in Infinite Horizon LQG-GMFGs
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 Hu…
Learning Graphon Mean Field Games and Approximate Nash Equilibria
Recent advances at the intersection of dense large graph limits and mean field games have begun to enable the scalable analysis of a broad class of dynamical sequential games with large numbers of agents. So far, results…
Hypergraphon Mean Field Games
We propose an approach to modelling large-scale multi-agent dynamical systems allowing interactions among more than just pairs of agents using the theory of mean field games and the notion of hypergraphons, which are obt…