3 search results - page 1 / 1 » Exponentially Many Steps for Finding a Nash Equilibrium in a... |
FOCS
2004
IEEE
14 years 2 months ago
2004
IEEE
The Lemke
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...