Vol. 5, Issue 4, 2008December 31, 2007 EDT
Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
Ackermann, Heiner, and Alexander Skopalik. 2008. “Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games.” Internet Mathematics 5 (4). https://doi.org/10.1080/15427951.2008.10129170.