Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > TWO-PROVER GAMES:
Reports tagged with Two-prover games:
TR14-092 | 22nd July 2014
Mark Braverman, Young Kun Ko, Omri Weinstein

#### Approximating the best Nash Equilibrium in $n^{o(\log n)}$-time breaks the Exponential Time Hypothesis

The celebrated PPAD hardness result for finding an exact Nash equilibrium in a two-player game
initiated a quest for finding \emph{approximate} Nash equilibria efficiently, and is one of the major open questions in algorithmic game theory.

We study the computational complexity of finding an $\eps$-approximate Nash equilibrium with good social ... more >>>

TR17-182 | 21st November 2017
Mark Braverman, Young Kun Ko

#### Information Value of Two-Prover Games

We introduce a generalization of the standard framework for studying the difficulty of two-prover games. Specifically, we study the model where Alice and Bob are allowed to communicate (with information constraints) --- in contrast to the usual two-prover game where they are not allowed to communicate after receiving their respective ... more >>>

ISSN 1433-8092 | Imprint