Nash equilibrium when players account for the complexity of their forecasts.
Kfir EliazPublished in: Games Econ. Behav. (2003)
Keyphrases
- nash equilibrium
- game theory
- mixed strategy
- repeated games
- game theoretic
- solution concepts
- pure strategy
- worst case
- cooperative games
- equilibrium strategies
- nash equilibria
- pure nash equilibrium
- pure nash equilibria
- variational inequalities
- imperfect information
- pareto optimal
- fictitious play
- multi agent systems
- correlated equilibrium
- stackelberg game
- regret minimization
- stochastic games
- congestion games
- data mining
- normal form games
- incentive compatible
- resource allocation
- upper bound
- computational complexity
- cooperative
- decision problems
- multistage
- data mining techniques
- lower bound