On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games.

Heiner Ackermann Alexander Skopalik

Published in: WINE (2007)

Keyphrases

pure nash equilibria
congestion games
game theoretic
pure nash equilibrium
decision problems
nash equilibria
network structure
nash equilibrium
computational complexity
network size
network traffic
complex networks
peer to peer
game theory
cooperative
sufficient conditions
worst case
mobile robot