The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an important open question. We put forward the notion of (0,1)-bimatrix games, and show that some associated computational problems are as hard as in the general case. © 2005 Elsevier B.V. All rights reserved.
Codenotti, B., & Štefankovič, D. (2005). On the computational complexity of Nash equilibria for (0,1) bimatrix games. Information Processing Letters, 94(3), 145–150. https://doi.org/10.1016/j.ipl.2005.01.010