3 search results - page 1 / 1 » Exponentially Many Steps for Finding a Nash Equilibrium in a... |
108
Voted
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
The Lemke
100
click to vote
CORR
2010
Springer
15 years 2 days 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.
15 years 11 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...