Related papers: A Constructive Generalization of Nash Equilibrium …
We consider graphical $n$-person games with perfect information that have no Nash equilibria in pure stationary strategies. Solving these games in mixed strategies, we introduce probabilistic distributions in all non-terminal positions. The…
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…
People choose their strategies through a trial-and-error learning process in which they gradually discover that some strategies work better than others. The process can be modelled as an evolutionary game dynamics system, which may be…
We introduce set packing games as an abstraction of situations in which $n$ selfish players select subsets of a finite set of indivisible items, and analyze the quality of several equilibria for this class of games. Assuming that players…
We consider a general-sum N-player linear-quadratic game with stochastic dynamics over a finite horizon and prove the global convergence of the natural policy gradient method to the Nash equilibrium. In order to prove the convergence of the…
We use techniques from the statistical mechanics of disordered systems to analyse the properties of Nash equilibria of bimatrix games with large random payoff matrices. By means of an annealed bound, we calculate their number and analyse…
Game-theoretic techniques and equilibria analysis facilitate the design and verification of competitive systems. While algorithmic complexity of equilibria computation has been extensively studied, practical implementation and application…
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…
This paper investigates design of noncooperative games from an optimization and control theoretic perspective. Pricing mechanisms are used as a design tool to ensure that the Nash equilibrium of a fairly general class of noncooperative…
In a strategic form game a strategy profile is an equilibrium if no viable coalition of agents (or players) benefits (in the Pareto sense) from jointly changing their strategies. Weaker or stronger equilibrium notions can be defined by…
Generalized Nash equilibrium (GNE) is a solution concept for complete information games, in which each player's objective function and feasible region depend on other players' actions. While numerical methods for finding GNE when players…
This paper studies $n$-person simultaneous-move games with linear best response function, where individuals interact within a given network structure. This class of games have been used to model various settings, such as, public goods,…
Self-play is a technique for machine learning in multi-agent systems where a learning algorithm learns by interacting with copies of itself. Self-play is useful for generating large quantities of data for learning, but has the drawback that…
Game theory provides a well-established framework for the analysis of concurrent and multi-agent systems. The basic idea is that concurrent processes (agents) can be understood as corresponding to players in a game; plays represent the…
This paper presents a new primal-dual method for computing an equilibrium of generalized (continuous) Nash game (referred to as generalized Nash equilibrium problem (GNEP)) where each player's feasible strategy set depends on the other…
In resource contribution games, a class of non-cooperative games, the players want to obtain a bundle of resources and are endowed with bags of bundles of resources that they can make available into a common for all to enjoy. Available…
We study the existence and computation of Nash equilibria in concave games where the players' admissible strategies are subject to shared coupling constraints. Under playerwise concavity of constraints, we prove existence of Nash…
The decisions that human beings make to allocate time has significant bearing on economic output and to the sustenance of social networks. The time allocation problem motivates our formal analysis of the resource allocation game, where…
We consider the existence and computational complexity of coalitional stability concepts based on social networks. Our concepts represent a natural and rich combinatorial generalization of a recent approach termed partition equilibrium. We…
Studying Nash dynamics is an important approach for analyzing the outcome of games with repeated selfish behavior of self-interested agents. Sink equilibria has been introduced by Goemans, Mirrokni, and Vetta for studying social cost on…