Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria.
Mika GöösAviad RubinsteinPublished in: CoRR (2018)
Keyphrases
- nash equilibria
- lower bound
- incomplete information
- game theory
- stochastic games
- upper bound
- nash equilibrium
- fictitious play
- game theoretic
- objective function
- branch and bound
- pure strategy
- np hard
- artificial intelligence
- worst case
- search space
- optimal solution
- solution concepts
- multiagent learning
- reinforcement learning