Related papers: Linear Quadratic Graphon Field Games
The paper is concerned with a zero-sum Stackelberg stochastic linear-quadratic (LQ, for short) differential game over finite horizons. Under a fairly weak condition, the Stackelberg equilibrium is explicitly obtained by first solving a…
Quadratic programming (QP) is the most widely applied category of problems in nonlinear programming. Many applications require real-time/fast solutions, though not necessarily with high precision. Existing methods either involve matrix…
This paper represents the first attempt to develop a theory for linear-quadratic mean field games in possibly infinite dimensional Hilbert spaces. As a starting point, we study the case, considered in most finite dimensional contributions…
We design and analyze reinforcement learning algorithms for Graphon Mean-Field Games (GMFGs). In contrast to previous works that require the precise values of the graphons, we aim to learn the Nash Equilibrium (NE) of the regularized GMFGs…
Even when confronted with the same data, agents often disagree on a model of the real-world. Here, we address the question of how interacting heterogenous agents, who disagree on what model the real-world follows, optimize their trading…
We consider dynamic games with linear dynamics and quadratic objective functions. We observe that the unconstrained open-loop Nash equilibrium coincides with a linear quadratic regulator in an augmented space, thus deriving an explicit…
We consider network games where a large number of agents interact according to a network sampled from a random network model, represented by a graphon. By exploiting previous results on convergence of such large network games to graphon…
Controlling network systems has become a problem of paramount importance. In this paper, we consider a distributed linear-quadratic problem and propose the use of graph neural networks (GNNs) to parametrize and design a distributed…
We introduce a framework for stochastic games on large sparse graphs, covering continuous-time and discrete-time dynamic games as well as static games. Players are indexed by the vertices of simple, locally finite graphs, allowing both…
We consider a class of mean field games in which the agents interact through both their states and controls, and we focus on situations in which a generic agent tries to adjust her speed (control) to an average speed (the average is made in…
$ $This paper addresses the inverse problem for Linear-Quadratic (LQ) nonzero-sum $N$-player differential games, where the goal is to learn parameters of an unknown cost function for the game, called observed, given the demonstrated…
We develop the theory of linear-quadratic (LQ) mean field games (MFGs) in Hilbert spaces with common noise modeled by an infinite-dimensional Wiener process that affects the dynamics of all agents. In the presence of common noise, the…
In this paper we discuss a class of mean field linear-quadratic-Gaussian (LQG) games for large population system which has never been addressed by existing literature. The features of our works are sketched as follows. First of all, our…
This letter presents an extended analysis and a novel upper bound of the subclass of Linear Quadratic Near Potential Differential Games (LQ NPDG). LQ NPDGs are a subclass of potential differential games, for which a distance between an LQ…
This paper revisits well-studied dynamic decisions of weakly coupled large-population (LP) systems. Specifically, three types of LP decision problems: mean-field game (MG), mean-field team (MT), and mean-field-type control (MC), are…
Mean field games models describing the limit of a large class of stochastic differential games, as the number of players goes to $+\infty$, have been introduced by J.-M. Lasry and P.-L. Lions. We use a change of variables to transform the…
Competitive games involving thousands or even millions of players are prevalent in real-world contexts, such as transportation, communications, and computer networks. However, learning in these large-scale multi-agent environments presents…
We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed non-negative integer bonus for picking a…
This paper studies a stochastic utility maximization game under relative performance concerns in finite agent and infinite agent settings, where a continuum of agents interact through a graphon (see definition below). We consider an…
In this paper, we introduce discrete-time linear mean-field games subject to an infinite-horizon discounted-cost optimality criterion. The state space of a generic agent is a compact Borel space. At every time, each agent is randomly…