1. Abbott, T., Kane, D., Valiant, P.: On the complexity of two-player win-lose games. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Sciences, pp. 113–122 (2005)
2. Borgs, C., Chayes, J., Immorlica, N., Tauman Kalai, A., Mirrokni, V., Papadimitriou, C.H.: The myth of the Folk theorem. Games Econ. Behav. 70(1), 34–43 (2010)
3. Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3) (2009)
4. Codenotti, B., Stefanovic, D.: On the computational complexity of Nash equilibria for (0,1) bimatrix games. Inf. Process. Lett. 94(3), 145–150 (2005)
5. Conitzer, V., Sandholm, T.: Complexity results about Nash equilibria. In: Proceedings of the 18th Joint Conference on Artificial Intelligence, pp. 765–771 (2003)