相关论文: The Dyson and Coulomb games

This paper presents a general closed graph property for (randomized strategy) Nash equilibrium correspondence in large games. In particular, we show that for any large game with a convergent sequence of fiinite-player games, the limit of…

This paper studies the problem of Nash equilibrium approximation in large-scale heterogeneous mean-field games under communication and computation constraints. A deterministic mean-field game is considered in which the non-linear utility…

Learning in games provides a powerful framework to design control policies for self-interested agents that may be coupled through their dynamics, costs, or constraints. We consider the case where the dynamics of the coupled system can be…

We discuss the long-run behavior of stochastic dynamics of many interacting players in spatial evolutionary games. In particular, we investigate the effect of the number of players and the noise level on the stochastic stability of Nash…

We consider finite $n$-person deterministic graphical (DG) games. These games are modelled by finite directed graphs (digraphs) $G$ which may have directed cycles and, hence, infinite plays. Yet, it is assumed that all these plays are…

We consider a class of Wasserstein distributionally robust Nash equilibrium problems, where agents construct heterogeneous data-driven Wasserstein ambiguity sets using private samples and radii, in line with their individual risk-averse…

We study the computation of Nash equilibria in a two-player normal form game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement…

The mean field limit of large-population symmetric stochastic differential games is derived in a general setting, with and without common noise, on a finite time horizon. Minimal assumptions are imposed on equilibrium strategies, which may…

In an $\epsilon$-Nash equilibrium, a player can gain at most $\epsilon$ by unilaterally changing his behaviour. For two-player (bimatrix) games with payoffs in $[0,1]$, the best-known$\epsilon$ achievable in polynomial time is 0.3393. In…

This paper introduces two fundamentally new concepts to game theory: multilateral Nash equilibria and families of games. Starting with non-cooperative games, we show how these notions together seamlessly integrate into and naturally extend…

Dynamic nonzero sum games are widely used to model multi agent decision making in control, economics, and related fields. Classical methods for computing Nash equilibria, especially in linear quadratic settings, rely on strong structural…

We consider a game in which each player must find a compromise between more daring strategies that carry a high risk for him to be eliminated, and more cautious ones that, however, reduce his final score. For two symmetric players this game…

In this paper, we investigate a class of mean field games where the mean field interactions are achieved through the joint (conditional) distribution of the controlled state and the control process. The strategies are of $open\;loop$ type,…

We show that in any $n$-player $m$-action normal-form game, we can obtain an approximate equilibrium by sampling any mixed-action equilibrium a small number of times. We study three types of equilibria: Nash, correlated and coarse…

In this paper, we present a method for finding approximate Nash equilibria in a broad class of reachability games. These games are often used to formulate both collision avoidance and goal satisfaction. Our method is computationally…

Game-theoretic approaches and Nash equilibrium have been widely applied across various engineering domains. However, practical challenges such as disturbances, delays, and actuator limitations can hinder the precise execution of Nash…

We are interested in the study of stochastic games for which each player faces an optimal stopping problem. In our setting, the players may interact through the criterion to optimise as well as through their dynamics. After briefly…

We study the global convergence of policy optimization for finding the Nash equilibria (NE) in zero-sum linear quadratic (LQ) games. To this end, we first investigate the landscape of LQ games, viewing it as a nonconvex-nonconcave…

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…

We consider a noncooperative $n$-player principal eigenvalue game which is associated with an infinitesimal generator of a stochastically perturbed multi-channel dynamical system -- where, in the course of such a game, each player attempts…