The communication complexity of uncoupled nash equilibrium procedures.
Sergiu HartYishay MansourPublished in: STOC (2007)
Keyphrases
- nash equilibrium
- worst case
- game theory
- game theoretic
- variational inequalities
- pareto optimal
- regret minimization
- nash equilibria
- mixed strategy
- stackelberg game
- decision problems
- computational complexity
- stochastic games
- cooperative
- upper bound
- solution concepts
- fictitious play
- lower bound
- imperfect information
- incentive compatible
- pure strategy
- profit maximizing
- multi agent
- objective function