1. Abbott, T., Kane, D., Valiant, P.: On the Complexity of Two-player Win-lose Games. In: Proc. of the 46th Annual IEEE Symposium on Fondations of Computer Science (FOCS), pp. 113–122. IEEE Computer Society, Los Alamitos (2005)
2. Addario-Berry, L., Olver, N., Vetta, A.: A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. Journal of Graph Algorithms and Applications 11(1), 309–319 (2007)
3. Lecture Notes in Computer Science;H. Bosse,2007
4. Chen, X., Deng, X.: Settling the Complexity of 2-Player Nash Equilibrium. In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 252–261. IEEE Computer Society, Los Alamitos (2006)
5. Chen, X., Deng, X., Teng, S.H.: Computing Nash Equilibria: Approximation and Smoothed Complexity. In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 603–612. IEEE Computer Society, Los Alamitos (2006)