Games, geometry, and the computational complexity of finding equilibria.
Bernhard von StengelPublished in: TARK (2007)
Keyphrases
- computational complexity
- nash equilibria
- game theoretic
- nash equilibrium
- game theory
- pure nash equilibria
- decision problems
- three dimensional
- special case
- np complete
- extensive form games
- video games
- low complexity
- repeated games
- high computational complexity
- search algorithm
- pure strategy
- fictitious play
- monte carlo tree search
- long run
- computationally efficient
- computational efficiency
- learning agents
- solution concepts
- geometric structure
- fixed point
- neural network
- games played
- rate distortion