Related papers: Robust perfect equilibrium in large games
We study natural improvement dynamics in weighted congestion games with polynomial latencies of maximum degree $d\geq 1$. We focus on two problems regarding the existence and efficiency of approximate pure Nash equilibria, with a reasonable…
This paper focuses on finite-player incomplete information games where players may hold mutually inconsistent beliefs without a common prior. We introduce absolute continuity of beliefs, extending the classical notion of absolutely…
Colonel Blotto games with discrete strategy spaces effectively illustrate the intricate nature of multidimensional strategic reasoning. This paper studies the equilibrium set of such games where, in line with prior experimental work, the…
In this paper we develop a novel approach to the convergence of Best-Response Dynamics for the family of interference games. Interference games represent the fundamental resource allocation conflict between users of the radio spectrum. In…
Games are natural models for multi-agent machine learning settings, such as generative adversarial networks (GANs). The desirable outcomes from algorithmic interactions in these games are encoded as game theoretic equilibrium concepts, e.g.…
We provide, to the best of our knowledge, the first computational study of extensive-form adversarial team games. These games are sequential, zero-sum games in which a team of players, sharing the same utility function, faces an adversary.…
In the framework of finite games in extensive form with perfect information and strict preferences, this paper introduces a new equilibrium concept: the Perfect Prediction Equilibrium (PPE). In the Nash paradigm, rational players consider…
We provide a unifying, black-box tool for establishing existence of approximate equilibria in weighted congestion games and, at the same time, bounding their Price of Stability. Our framework can handle resources with general…
We analyze inertial coordination games: dynamic coordination games with an endogenously changing state that depends on (i) a persistent fundamental players privately learn about over time; and (ii) past play. The speed of learning…
We consider the dynamics, existence and stability of the equilibrium states for large populations of individuals who can play various types of non--cooperative games. The players imitate the most attractive strategies, and the choice is…
We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES)…
We tackle a fundamental problem in empirical game-theoretic analysis (EGTA), that of learning equilibria of simulation-based games. Such games cannot be described in analytical form; instead, a black-box simulator can be queried to obtain…
After defining a pure-action profile in a nonatomic aggregative game, where players have specific compact convex pure-action sets and nonsmooth convex cost functions, as a square-integrable function, we characterize a Wardrop equilibrium as…
This paper develops a unified framework for zero-sum games in which both the pure strategies and the payoff matrices contain complex-valued entries. By leveraging a linear isomorphism between complex and real vector spaces, we extend key…
In this paper, we investigate a class of nonzero-sum dynamic stochastic games, where players have linear dynamics and quadratic cost functions. The players are coupled in both dynamics and cost through a linear regression (weighted average)…
In optimal stopping problems, a Markov structure guarantees Markovian optimal stopping times (first exit times). Surprisingly, there is no analogous result for Markovian stopping games once randomization is required. This paper addresses…
A central task of artificial intelligence is the design of artificial agents that act towards specified goals in partially observed environments. Since such environments frequently include interaction over time with other agents with their…
This paper proposes a dynamic game formulation for cooperative human-robot navigation in shared workspaces with obstacles, where the human and robot jointly satisfy shared safety constraints while pursuing a common task. A key contribution…
Many interactions result in a socially suboptimal equilibrium, or in a non-equilibrium state, from which arriving at an equilibrium through simple dynamics can be impossible of too long. Aiming to achieve a certain equilibrium, we persuade,…
Drawing intuition from a (physical) hydraulic system, we present a novel framework, constructively showing the existence of a strong Nash equilibrium in resource selection games (i.e., asymmetric singleton congestion games) with nonatomic…