36 search results - page 8 / 8 » Polynomial-time Algorithms from Ineffective Proofs |
154
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...