Heiner Ackermann, Alexander Skopalik. Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. Internet Mathematics, 5(4):323-342, 2008. [doi]
@article{AckermannS08,
title = {Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games},
author = {Heiner Ackermann and Alexander Skopalik},
year = {2008},
url = {http://akpeters.metapress.com/content/d57m574715422326/},
researchr = {https://researchr.org/publication/AckermannS08},
cites = {0},
citedby = {0},
journal = {Internet Mathematics},
volume = {5},
number = {4},
pages = {323-342},
}