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 …

Since the celebrated PPAD-completeness result for Nash equilibria in bimatrix games, a
long line of research has focused on polynomial-time algorithms that compute ε-approximate …

Since the seminal PPAD-completeness result for computing a Nash equilibrium even in two-
player games, an important line of research has focused on relaxations achievable in …

We study symmetric bimatrix games that also have the common-payoff property, ie, the two
players receive the same payoff at any outcome of the game. Due to the symmetry property …

Multi-player approximate Nash equilibria Page 1 Multi-player approximate Nash equilibria ∗
(Extended Abstract) Artur Czumaj1 Michail Fasoulakis1,2 Marcin Jurdzinski1 Department of …

While there have been a number of studies about the efficacy of methods to find exact Nash
equilibria in bimatrix games, there has been little empirical work on finding approximate …

We study the problem of computing approximate Nash equilibria of bimatrix games, in a
setting where players initially know their own payoffs but not the other player's. In order to …

Strategic interactions can be represented more concisely, and analyzed and solved more
efficiently, if we are aware of the symmetries within the multiagent system. Symmetries also …

The ε-well-supported Nash equilibrium is a strong notion of approximation of a Nash
equilibrium, where no player has an incentive greater than ε to deviate from any of the pure …

A two-player finite game is represented by two payoff matrices (A, B), one for each player.
Imitation games are a subclass of two-player games in which B is the identity matrix …