The Computational Complexity of Nash Equilibria in Concisely Represented Games.
Grant SchoenebeckSalil P. VadhanPublished in: ACM Trans. Comput. Theory (2012)
Keyphrases
- nash equilibria
- computational complexity
- game theory
- incomplete information
- stochastic games
- fictitious play
- nash equilibrium
- pure strategy
- game theoretic
- solution concepts
- special case
- subgame perfect
- worst case
- congestion games
- decision problems
- autonomous agents
- multiagent learning
- np hard
- mixed strategy
- cooperative
- machine learning