Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > TWO-PERSON GAME:
Reports tagged with Two-person game:
TR06-023 | 7th February 2006
Xi Chen, Xiaotie Deng, Shang-Hua Teng

#### Computing Nash Equilibria: Approximation and Smoothed Complexity

By proving that the problem of computing a $1/n^{\Theta(1)}$-approximate Nash equilibrium remains \textbf{PPAD}-complete, we show that the BIMATRIX game is not likely to have a fully polynomial-time approximation scheme. In other words, no algorithm with time polynomial in $n$ and $1/\epsilon$ can compute an $\epsilon$-approximate Nash equilibrium of an \$n\times ... more >>>

ISSN 1433-8092 | Imprint