The complexity of approximate Nash equilibrium in congestion games with negative delays
Frédéric MagniezMichel de RougemontMiklos SanthaXavier ZeitounPublished in: CoRR (2011)
Keyphrases
- nash equilibrium
- congestion games
- nash equilibria
- pure strategy
- pure nash equilibria
- pure nash equilibrium
- worst case
- game theory
- pareto optimal
- mixed strategy
- game theoretic
- stochastic games
- fictitious play
- variational inequalities
- solution concepts
- incomplete information
- stackelberg game
- special case
- finite horizon
- computational complexity
- approximation algorithms
- decision problems
- upper bound
- cost function