Complexity of finding Nash equilibria in 0-1 bimatrix games
Author(s) • •
Abbott, Tim
Kane, Daniel
Valiant, Paul
Date Issued
February 8, 2005
Series/Report no.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Abstract
We exhibit a polynomial reduction from the problem of finding a Nashequilibrium of a bimatrix game with rational coefficients to the problemof finding a Nash equilibrium of a bimatrix game with 0-1 coefficients.
Persistent DSpace Link