On the computational complexity of Nash equilibria for (0, 1) bimatrix games.
Bruno CodenottiDaniel StefankovicPublished in: Inf. Process. Lett. (2005)
Keyphrases
- nash equilibria
- computational complexity
- game theory
- incomplete information
- stochastic games
- nash equilibrium
- game theoretic
- fictitious play
- decision problems
- pure strategy
- solution concepts
- special case
- np hard
- congestion games
- subgame perfect
- upper bound
- multi agent systems
- lower bound
- multiagent learning
- mixed strategy