Related papers: Representing Strategic Games and Their Equilibria …
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 study the asymptotic organization among many optimizing individuals interacting in a suitable "moderate" way. We justify this limiting game by proving that its solution provides approximate Nash equilibria for large but finite player…
We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other…
We study Nash equilibria for the deterministic ergodic N-players game. We introduce pure strategies, mixed strategies and Nash equilibria associated with those. We show that a Nash equilibrium in mixed strategies exists and it is a Mather…
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…
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 describe an efficient algorithm to compute solutions for the general two-player Blotto game on n battlefields with heterogeneous values. While explicit constructions for such solutions have been limited to specific, largely symmetric or…
Rating strategies in a game is an important area of research in game theory and artificial intelligence, and can be applied to any real-world competitive or cooperative setting. Traditionally, only transitive dependencies between strategies…
In Stackelberg v/s Stackelberg games a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problems are plagued by the nonuniqueness of…
We investigate an alternative concept of Nash equilibrium, m-equilibrium, which slightly resembles Harsanyi-Selten risk dominant equilibrium although it is a different notion. M-equilibria provide nontrivial solutions of normal form games…
We study mean field games and corresponding $N$-player games in continuous time over a finite time horizon where the position of each agent belongs to a finite state space. As opposed to previous works on finite state mean field games, we…
Landsburg method of classifying mixed Nash equilibria for maximally entangled Eisert-Lewenstein-Wilkens (ELW) game is analyzed with special emphasis on symmetries inherent to the problem. Nash equilibria for the original ELW game are…
We introduce Contested Logistics Games, a variant of logistics problems that account for the presence of an adversary that can disrupt the movement of goods in selected areas. We model this as a large two-player zero-sum one-shot game…
Strategic-form min-max game theory examines the existence, multiplicity, selection of equilibria, and the worst-case computational complexity under perfect rationality. However, in many applications, games are drawn from an ensemble, and…
Solving Nash equilibrium is the key challenge in normal-form games with large strategy spaces, where open-ended learning frameworks offer an efficient approach. In this work, we propose an innovative unified open-ended learning framework…
In general, Nash equilibria in normal-form games may require players to play (probabilistically) mixed strategies. We define a measure of the complexity of finite probability distributions and study the complexity required to play Nash…
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…
Many important real-world settings contain multiple players interacting over an unknown duration with probabilistic state transitions, and are naturally modeled as stochastic games. Prior research on algorithms for stochastic games has…
The increasing prevalence of multi-agent learning systems in society necessitates understanding how to learn effective and safe policies in general-sum multi-agent environments against a variety of opponents, including self-play.…
Number games play a central role in alternating normal play combinatorial game theory due to their real-number-like properties (Conway 1976). Here we undertake a critical re-examination: we begin with integer and dyadic games and identify…