Computing Nash equilibria gets harder - New results show hardness even for parameterized complexity

Conferences in Research and Practice in Information Technology Series

Volumn 94, Issue , 2009, Pages

  Estivill Castro, Vladimir ^a   Parsa, Mahdi ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Game theory; Nash equilibrium; Parameterized complexity

Indexed keywords

DECISION PROBLEMS; FIXED-PARAMETER TRACTABILITY; INTEGER VALUES; NASH EQUILIBRIA; NASH STRATEGY; NEW RESULTS; NONNEGATIVE INTEGERS; NP COMPLETE; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME; TRACTABLE ALGORITHMS; ZERO-SUM GAME;

COMPUTATIONAL COMPLEXITY; GAME THEORY; POLYNOMIAL APPROXIMATION;

TELECOMMUNICATION NETWORKS;

EID: 84863992187     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Abbott, T., Kane, D. & Valiant, P. (2005), On the complexity of two-player win-lose games, in 'Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science', IEEE Computer Society, pp. 113-122.
2. Bomze, I. M. (1997), 'Evolution towards the maximum clique', Journal of Global Optimization 10(2), 143-164.
3. Bomze, I. M. (1998), 'On standard quadratic optimization problems', Journal of Global Optimization 13(4), 369-387.
4. Bonifaci, V., Iorio, U. D. & Laura, L. (2008), 'The complexity of uniform Nash equilibria and related regular subgraph problems', Theoretical Computer Science 401(1-3), 144-152.
5. Chen, Y. & Flum, J. (2008), 'The parameterized complexity of maximality and minimality problems', Annals of Pure and Applied Logic 151(1), 22-61.
6. Chu, F. C. & Halpern, J. Y. (2001), 'On the NPcompleteness of finding an optimal strategy in games with common payoffs', Int. J. Game Theory 30(1), 99-106.
7. Codenotti, B. & Stefankovic, D. (2005), 'On the computational complexity of Nash equilibria for (0,1) bimatrix games', Information Processing Letters 94(3), 145-150.
8. Conitzer, V. & Sandholm, T. (2003), Complexity results about Nash equilibria, in G. Gottlob & T. Walsh, eds, 'IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence', Morgan Kaufmann, Acapulco, Mexico, pp. 765-771.
9. Downey, R. & Fellows, M. R. (1998), Parameterized Complexity (Monographs in Computer Science), Springer.
10. Gilboa, I. & Zemel, E. (1989), 'Nash and correlated equilibria: Some complexity considerations', Games and Economic Behavior 1(1), 80-93.
11. Kalyanaraman, S. & Umans, C. (2007), Algorithms for playing games with limited randomness, in L. Arge, M. Hoffmann & E. Welzl, eds, 'Algorithms - ESA 2007, 15th Annual European Symposium', Vol. 4698 of Lecture Notes in Computer Science, Springer, Eilat, Israel, pp. 323-334.
12. Luce, R. D. & Raiffa, H. (1957), Games and Decision - Introduction and Critical Survey, Dover, New York.
13. McLennan, A. & Tourky, R. (2005), 'Simple complexity from imitation games'. http://www.econ.umn.edu/~mclennan/Papers/clique. pdf.
14. Niedermeier, R. (2006), Invitation to Fixed-Parameter Algorithms, Oxford University Press, Oxford.
15. Papadimitriou, C. (2001), Algorithms, games, and the Internet, in 'STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing', ACM Press, pp. 749-753.
16. Papadimitriou, C. H. (2007), The complexity of finding Nash equilibria, in A. Nisan, R. Roughgarden, E. Tardos & V. Vazirani, eds, 'Algorithmic Game Theory', Cambridge University Press, NY, pp. 29- 51.
17. Tardos, E. & Vazirani, V. (2007), Basic solution concepts and computational issues, in A. Nisan, R. Roughgarden, E. Tardos & V. Vazirani, eds, 'Algorithmic Game Theory', Cambridge University Press, NY, pp. 3-28.
18. von Neumann, J. & Morgenstern, O. (1947), Theory of Games and Economic Behavior, Princeton University Press, Princeton, USA.
19. von Stengel, B. (2002), Computing equilibria for two-person games, in R. J. Aumann & S. Hart, eds, 'Handbook of Game Theory', Vol. 3, North-Holland, Amsterdam, pp. 1723-1759. Chapter 45.