Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria.
Mika GöösAviad RubinsteinPublished in: FOCS (2018)
Keyphrases
- nash equilibria
- lower bound
- stochastic games
- incomplete information
- game theory
- nash equilibrium
- upper bound
- fictitious play
- game theoretic
- objective function
- np hard
- pure strategy
- branch and bound
- multiagent learning
- solution concepts
- upper and lower bounds
- vc dimension
- worst case
- optimal solution
- markov decision processes
- expert systems