1. Althöfer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra and Applications 199, 339–355 (1994)
2. Chen, X., Deng, X.: Settling the complexity of 2-player Nash equilibrium. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 261–272. IEEE Computer Society Press, Los Alamitos (2006)
3. Chen, X., Deng, X., Teng, S.: Computing Nash equilibria: Approximation and smoothed complexity. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 603–612. IEEE Computer Society Press, Los Alamitos (2006)
4. Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: Annual ACM Symposium on Theory of Computing, pp. 71–78. ACM Press, New York (2006)
5. Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: Workshop on Internet and Network Economics, pp. 297–306 (2006)