Elbassioni, Khaled Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Boros, E., Elbassioni, K., Gurvich, V., Makino, K., & Oudalov, V. (2008). A Complete Characterization of Nash-solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames. In E. A. Hirsch, A. A. Razborov, A. Semenov, & A. Slissenko (Eds.), Computer Science - Theory and Applications (pp. 99-109). Berlin: Springer. doi:10.1007/978-3-540-79709-8_13.