The complexity of equilibria: Hardness results for economies via a correspondence with games.
Bruno CodenottiAmin SaberiKasturi R. VaradarajanYinyu YePublished in: Theor. Comput. Sci. (2008)
Keyphrases
- nash equilibria
- game theoretic
- game theory
- nash equilibrium
- computational complexity
- worst case
- pure nash equilibria
- decision problems
- pure strategy
- np hardness
- extensive form games
- mixed strategy
- solution concepts
- educational games
- pure nash equilibrium
- repeated games
- neural network
- point correspondences
- space complexity
- imperfect information
- incomplete information
- computer games
- multiagent learning
- np complete
- search algorithm
- cooperative
- multi agent