World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS formula-COMPLETE

    We determine the complexity of computing pure Nash equilibria in restricted network congestion games. Restricted network congestion games are network congestion games, where for each player there exits a set of edges which he is not allowed to use. Rosenthal's potential function guarantees the existence of a Nash Equilibrium. We show that computing a Nash equilibrium in a restricted network congestion game with two players is -complete, using a tight reduction from MAXCUT. The result holds for directed networks and for undirected networks.

    This work has been partially supported by German Research Foundation (DFG) Priority Programme 1307 Algorithm Engineering.