6 search results - page 2 / 2 » On Strong Equilibria in the Max Cut Game |
116
click to vote
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...