Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games.
Heiner AckermannAlexander SkopalikPublished in: Internet Math. (2008)
Keyphrases
- pure nash equilibria
- congestion games
- game theoretic
- pure nash equilibrium
- nash equilibria
- decision problems
- nash equilibrium
- cost function
- game theory
- worst case
- network structure
- complex networks
- network size
- peer to peer
- linear programming
- cooperative
- network traffic
- upper bound
- mobile robot
- lower bound
- computational complexity