Related papers: Leveraging Team Correlation for Approximating Equi…
We study two-player zero-sum repeated games with incomplete information on one side, where the payoff function is tail measurable (and not necessarily the long-run average payoff). We show that the maxmin value equals the concavification of…
We study the problem of computing an Extensive-Form Perfect Equilibrium (EFPE) in 2-player games. This equilibrium concept refines the Nash equilibrium requiring resilience w.r.t. a specific vanishing perturbation (representing mistakes of…
We study data corruption robustness in offline two-player zero-sum Markov games. Given a dataset of realized trajectories of two players, an adversary is allowed to modify an $\epsilon$-fraction of it. The learner's goal is to identify an…
This paper is about a set-based computing method for solving a general class of two-player zero-sum Stackelberg differential games. We assume that the game is modeled by a set of coupled nonlinear differential equations, which can be…
Often times, individuals working together as a team can solve hard problems beyond the capability of any individual in the team. Cooperative optimization is a newly proposed general method for attacking hard optimization problems inspired…
We consider a class of $N$-player games and mean-field games of singular controls with ergodic performance criterion, providing a benchmark case for irreversible investment games featuring mean-field interaction and strategic…
We give a simple proof of the well-known result that the marginal strategies of a coarse correlated equilibrium form a Nash equilibrium in two-player zero-sum games. A corollary of this fact is that no-external-regret learning algorithms…
Computing approximate Nash equilibria in multi-player general-sum Markov games is a computationally intractable task. However, multi-player Markov games with certain cooperative or competitive structures might circumvent this…
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…
We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety…
Concurrent stochastic games are an important formalism for the rational verification of probabilistic multi-agent systems, which involves verifying whether a temporal logic property is satisfied in some or all game-theoretic equilibria of…
Coordination in multiplayer games enables players to avoid the lose-lose outcome that often arises at Nash equilibria. However, designing a coordination mechanism typically requires the consideration of the joint actions of all players,…
We consider the relation between Sion's minimax theorem for a continuous function and a Nash equilibrium in a multi-players game with two groups which is zero-sum and symmetric in each group. We will show the following results. 1. The…
People, robots, and companies mostly divide time and effort among projects, and \defined{shared effort games} model people investing resources in public endeavors and sharing the generated values. In linear $\theta$ sharing (effort) games,…
Within the context of video games the notion of perfectly rational agents can be undesirable as it leads to uninteresting situations, where humans face tough adversarial decision makers. Current frameworks for stochastic games and…
We study the problem of finding robust equilibria in multiplayer concurrent games with mean payoff objectives. A $(k,t)$-robust equilibrium is a strategy profile such that no coalition of size $k$ can improve the payoff of one its member by…
We consider solutions of normal form games that are invariant under strategic equivalence. We consider additional properties that can be expected (or be desired) from a solution of a game, and we observe the following: - Even the weakest…
Distributed optimization and Nash equilibrium (NE) seeking problems have drawn much attention in the control community recently. This paper studies a class of non-cooperative games, known as N-cluster game, which subsumes both cooperative…
We revisit classic algorithmic search and optimization problems from the perspective of competition. Rather than a single optimizer minimizing expected cost, we consider a zero-sum game in which an optimization problem is presented to two…
We consider a sub-class of bi-matrix games which we refer to as two-person (hereafter referred to as two-player) additively-separable sum (TPASS) games, where the sum of the pay-offs of the two players is additively separable. The row…