On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
Network congestion games with player-specific delay functions do not necessarily possess pure Nash equilibria. We therefore address the computational complexity of the corresponding decision problem, and show that it is NP-complete to decide whether such games possess pure Nash equilibria. This negative result still holds in the case of games with two players only. In contrast, we show that one can decide in polynomial time whether an equilibrium exists if the number of resources is constant.
In addition, we introduce a family of player-specific network congestion games which are guaranteed to possess equilibria. In these games players have identical delay functions, however, each player may only use a certain subset of the edges. For this class of games we prove that finding a pure Nash equilibrium is PLS-complete even in the case of three players. Again, in the case of a constant number of edges an equilibrium can be computed in polynomial time.
We conclude that the number of resources has a bigger impact on the computation complexity of certain problems related to network congestion games than the number of players.
KeywordsNash Equilibrium Constant Number Delay Function Congestion Game Path Segment
Unable to display preview. Download preview PDF.
- 1.Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 613–622 (2006)Google Scholar
- 3.Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 295–304 (2004)Google Scholar
- 6.Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 604–612 (2004)Google Scholar
- 9.Meyers, C.: Network Flow Problems and Congestion Games: Complexitiy and Approximation. Massachusetts Institute of Technology (2006)Google Scholar
- 12.Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (forthcoming)Google Scholar