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

Heiner Ackermann Alexander Skopalik On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. 419-430 2007 conf/wine/2007 WINE http://dx.doi.org/10.1007/978-3-540-77105-0_47 db/conf/wine/wine2007.html#AckermannS07