On the Complexity of Nash Equilibria and Other Fixed Points.
Kousha EtessamiMihalis YannakakisPublished in: SIAM J. Comput. (2010)
Keyphrases
- fixed point
- nash equilibria
- stochastic games
- game theory
- incomplete information
- sufficient conditions
- fictitious play
- dynamical systems
- approximate value iteration
- computational complexity
- game theoretic
- nash equilibrium
- decision problems
- asymptotic properties
- temporal difference learning
- linear logic
- free energy
- higher order
- mixed strategy
- worst case