Complexity of finding Nash equilibria in 0-1 bimatrix games
Author(s)Abbott, Tim; Kane, Daniel; Valiant, Paul
Cryptography and Information Security
MetadataShow full item record
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.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory