Related papers: Finite State Graphon Games with Applications to Ep…
We consider a class of two-player dynamic stochastic nonzero-sum games where the state transition and observation equations are linear, and the primitive random variables are Gaussian. Each controller acquires possibly different dynamic…
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 for approximating…
We discuss and solve a model for a game with many players, where a subset of truely deciding players is embedded into a hierarchy of dependent agents. These interdependencies modify the game matrix and the Nash equilibria for the deciding…
A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an $\epsilon$-Nash equilibrium if no player can gain more than $\epsilon$ by…
In this article we study the convergence of the Nash Equilibria in a N-player differential game towards the optimal strategies in the Mean Field Games, when the dynamic of the generic player includes a reflection process which guarantees…
We investigate infinite games on finite graphs where the information flow is perturbed by nondeterministic signalling delays. It is known that such perturbations make synthesis problems virtually unsolvable, in the general case. On the…
We study potential games on unimodular random graphs of bounded degree, where players interact through the underlying network. Using the unimodular measure, we define a well-posed global potential that captures both finite- and…
This paper is concerned with an indefinite linear-quadratic mean field games of stochastic large-population system, where the individual diffusion coefficients can depend on both the state and the control of the agents. Moreover, the…
Learning processes in games explain how players grapple with one another in seeking an equilibrium. We study a natural model of learning based on individual gradients in two-player continuous games. In such games, the arguably natural…
To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…
We provide a distributed algorithm to learn a Nash equilibrium in a class of non-cooperative games with strongly monotone mappings and unconstrained action sets. Each player has access to her own smooth local cost function and can…
We introduce and study a class of infinite-horizon non-zero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions,…
This work proposes a novel distributed approach for computing a Nash equilibrium in convex games with restricted strongly monotone pseudo-gradients. By leveraging the idea of the centralized operator extrapolation method presented in [4] to…
In this note, we study a class of deterministic finite-horizon linear-quadratic difference games with coupled affine inequality constraints involving both state and control variables. We show that the necessary conditions for the existence…
We consider stochastic differential games with a large number of players, with the aim of quantifying the gap between closed-loop, open-loop and distributed equilibria. We show that, under two different semi-monotonicity conditions, the…
We investigate an SIR model of epidemic propagation on networks in the context of mean-field games. In a real epidemic, individuals adjust their behavior depending on the epidemic level and the impact it might have on them in the future.…
This article introduces a class of $Nash$ games among $Stackelberg$ players ($NASPs$), namely, a class of simultaneous non-cooperative games where the players solve sequential Stackelberg games. Specifically, each player solves a…
In stochastic dynamic games, when the number of players is sufficiently large and the interactions between agents depend on empirical state distribution, one way to approximate the original game is to introduce infinite-population limit of…
This paper explores distributed Nash equilibrium seeking problems for games in which the players have limited knowledge on other players' actions. In particular, the involved players are considered to be high-order integrators with their…
We define solution concepts appropriate for computationally bounded players playing a fixed finite game. To do so, we need to define what it means for a \emph{computational game}, which is a sequence of games that get larger in some…