1. Berg, K., Sandholm, T.: Exclusion method for finding Nash equilibrium in multiplayer games. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 383–389 (2017)
2. Chen, G., Shen, D., Kwan, C., Cruz, J., Kruger, M., Blasch, E.: Game theoretic approach to threat prediction and situation awareness. J. Adv. Inf. Fusion 2(1), 1–14 (2006)
3. Chen, X., Deng, X.: 3-Nash is PPAD-complete. In: Electronic Colloquium on Computational Complexity Report No. 134, pp. 1–12 (2005)
4. Chen, X., Deng, X.: Settling the complexity of 2-player Nash equilibrium. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS) (2006)
5. Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 1(39), 195–259 (2009)