Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity.
Vladimir Estivill-CastroMahdi ParsaPublished in: CATS (2009)
Keyphrases
- nash equilibria
- parameterized complexity
- fixed parameter tractable
- np hard
- np complete
- game theory
- stochastic games
- incomplete information
- game theoretic
- nash equilibrium
- global constraints
- fictitious play
- pure strategy
- computational complexity
- cooperative
- approximation algorithms
- computational problems
- worst case
- resource allocation
- lower bound