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. Addario-Berry, L., Olver, N., Vetta, A.: A polynomial time algorithm for finding Nash equilibria in planar win-lose games. J. Graph Algorithms Appl. 11(1), 309–319 (2007)
3. Bilò, V., Fanelli, A.: Computing exact and approximate Nash equilibria in 2-player games. In: Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management, Vol. 6124, pp. 58–69, Lecture Notes in Computer Science. Springer (2010)
4. Bilò, V., Mavronicolas, M.: Complexity of rational and irrational Nash equilibria. Theory Comput. Syst. 54(3), 491–527 (2014)
5. Bilò, V., Mavronicolas, M.: A catalog of $$\exists {\mathbb{R}}$$-complete decision problems about Nash equilibria in multi-player games. In: Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science, Article No. 17, vol. 47, pp. 17:1–17:13, LIPIcs, Schloss Dagstuhl - Leibniz Zentrum fuer Informatik (2016)