Communication complexity of approximate Nash equilibria.

Yakov Babichenko Aviad Rubinstein

Published in: STOC (2017)

Keyphrases

nash equilibria
incomplete information
stochastic games
game theory
game theoretic
fictitious play
computational complexity
nash equilibrium
decision problems
lower bound
upper bound
worst case
artificial intelligence
markov decision processes
multiagent learning
pure strategy