1. Polynomial space suffices for deciding Nash equilibria properties for extensive games with large trees;Àlvarez,2005
2. Pure Nash equilibria in games with a large number of actions;Àlvarez,2005
3. Structural Complexity I;Balcazar,1995
4. Symmetries and the complexity of pure Nash equilibrium;Brandt;J. Comput. System Sci.,2009
5. X. Chen, X. Deng, 3-NASH is PPAD-complete, Technical Report 134, Electronic Colloquium on Computational Complexity (ECCC), 2005.