Bounds for the Communication Complexity of Two-Player Approximate Correlated Equilibria.
Young Kun KoAriel SchvartzmanPublished in: Electron. Colloquium Comput. Complex. (2017)
Keyphrases
- game theoretic
- worst case
- nash equilibria
- nash equilibrium
- upper bound
- lower bound
- decision problems
- repeated games
- computational cost
- neural network
- long run
- exact solution
- computational complexity
- average case
- lower and upper bounds
- error tolerance
- computer networks
- optimal strategy
- incomplete information
- fixed point
- multi agent
- objective function