Complexity of finding Nash equilibria in 0-1 bimatrix games

Unknown author (2005-02-08)

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.