The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays.

Frédéric Magniez Michel de Rougemont Miklos Santha Xavier Zeitoun

Published in: WINE (2011)

Keyphrases

nash equilibrium
congestion games
pure strategy
nash equilibria
pure nash equilibria
game theory

worst case
pure nash equilibrium
game theoretic
mixed strategy
stackelberg game

solution concepts
variational inequalities
pareto optimal
computational complexity
profit maximizing

finite horizon
cooperative
fictitious play
special case
multi agent systems