Related papers: Game Connectivity and Adaptive Dynamics
Coordination games have been of interest to game theorists, economists, and ecologists for many years to study such problems as the emergence of local conventions and the evolution of cooperative behavior. Approaches for understanding the…
We prove that in a normal form n-player game with m actions for each player, there exists an approximate Nash equilibrium where each player randomizes uniformly among a set of O(log(m) + log(n)) pure strategies. This result induces an…
Considering infinite-horizon, discrete-time, linear quadratic, N-player dynamic games with scalar dynamics, a graphical representation of feedback Nash equilibrium solutions is provided. This representation is utilised to derive conditions…
In this work, we provide a structural characterization of the possible Nash equilibria in the well-studied class of security games with additive utility. Our analysis yields a classification of possible equilibria into seven types and we…
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…
We extend the study of the complexity of finding an $\eps$-approximate Nash equilibrium in congestion games from the case of positive delay functions to delays of arbitrary sign. We first prove that in symmetric games with $\alpha$-bounded…
Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for…
This paper addresses the problem of fair equilibrium selection in graphical games. Our approach is based on the data structure called the {\em best response policy}, which was proposed by Kearns et al. \cite{kls} as a way to represent all…
Imitation dynamics for population games are studied and their asymptotic properties analyzed. In the considered class of imitation dynamics - that encompass the replicator equation as well as other models previously considered in…
Network games provide a powerful framework for modeling agent interactions in networked systems, where players are represented by nodes in a graph and their payoffs depend on the actions taken by their neighbors. Extending the framework of…
Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet…
In this paper, we examine the robustness of Nash equilibria in continuous games, under both strategic and dynamic uncertainty. Starting with the former, we introduce the notion of a robust equilibrium as those equilibria that remain…
In population games, a large population of players, modeled as a continuum, is divided into subpopulations, and the fitness or payoff of each subpopulation depends on the overall population composition. Evolutionary dynamics describe how…
We study the convergence to local Nash equilibria of gradient methods for two-player zero-sum differentiable games. It is well-known that such dynamics converge locally when $S \succ 0$ and may diverge when $S=0$, where $S\succeq 0$ is the…
We introduce and investigate certain $N$ player dynamic games on the line and in the plane that admit Coulomb gas dynamics as a Nash equilibrium. Most significantly, we find that the universal local limit of the equilibrium is sensitive to…
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…
We consider continuous-time equilibrium seeking in monotone aggregative games with coupling constraints. We propose semi-decentralized integral dynamics and prove their global convergence to a variational generalized aggregative or Nash…
Learning problems commonly exhibit an interesting feedback mechanism wherein the population data reacts to competing decision makers' actions. This paper formulates a new game theoretic framework for this phenomenon, called "multi-player…
We consider a dynamical approach to sequential games. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding restriction…
We study a class of games which model the competition among agents to access some service provided by distributed service units and which exhibit congestion and frustration phenomena when service units have limited capacity. We propose a…