How long does it take until economic agents converge to an equilibrium? By studying the
complexity of the problem of computing a mixed Nash equilibrium in a game, we provide …

We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is
complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

This paper develops three game-theoretical models to analyze shipping competition
between two carriers in a new emerging liner container shipping market. The behavior of …

The quest for a polynomial-time approximation scheme (PTAS) for Nash equilibrium in a two-
player game, which emerged as a major open question in algorithmic game theory, seeks to …

We show that computing a relatively (ie, multiplicatively as opposed to additively)
approximate Nash equilibrium in two-player games is PPAD-complete, even for constant …

We present algorithmic applications of an approximate version of Caratheodory's theorem.
The theorem states that given a set of vectors X in Rd, for every vector in the convex hull of X …

In view of the intractability of finding a Nash equilibrium, it is important to understand the
limits of approximation in this context. A subexponential approximation scheme is known …

In this paper we propose a new methodology for determining approximate Nash equilibria of
non-cooperative bimatrix games and, based on that, we provide an efficient algorithm that …

Computational complexity is the subfield of computer science that rigorously studies the
intrinsic difficulty of computational problems. This survey explains how complexity theory …