Settling the complexity of computing approximate two-player Nash equilibria.

Aviad Rubinstein

Published in: SIGecom Exch. (2017)

Keyphrases

nash equilibria
incomplete information
stochastic games
game theory
nash equilibrium
game theoretic
fictitious play
solution concepts
pure strategy
decision problems
multiagent learning
computational complexity
worst case
multi agent
cooperative
mixed strategy