On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games.
Juliane DunkelAndreas S. SchulzPublished in: Math. Oper. Res. (2008)
Keyphrases
- nash equilibria
- pure strategy
- congestion games
- incomplete information
- nash equilibrium
- game theory
- stochastic games
- mixed strategy
- game theoretic
- fictitious play
- pure nash equilibria
- decision problems
- solution concepts
- multiagent learning
- worst case
- finite horizon
- special case
- upper bound
- genetic algorithm
- np hard
- computational complexity
- linear programming
- reinforcement learning