The Computational Complexity of Nash Equilibria
Although the computation of Nash equlibria for general games is of unknown complexity, there exist many algorithms for specific game classes, some of which are a marked improvement of previous algorithms. This paper reviews general results on the computational complexity of Nash equilibria and discusses the major algorithms for specific game classes.
2005 ◽
Vol 94
(3)
◽
pp. 145-150
◽
2012 ◽
Vol 4
(2)
◽
pp. 1-50
◽
1989 ◽
Vol 53
(9)
◽
pp. 552-555
Keyword(s):
2009 ◽
Vol E92-A
(11)
◽
pp. 2717-2722
◽
2016 ◽
Vol E99.A
(12)
◽
pp. 2211-2217