Loading [Contrib]/a11y/accessibility-menu.js

This website uses cookies

We use cookies to enhance your experience and support COUNTER Metrics for transparent reporting of readership statistics. Cookie data is not sold to third parties or used for marketing purposes.

Skip to main content
null
Internet Mathematics
  • Menu
  • Articles
    • General
    • Special Issue for WAW'15
    • Special Issue for WAW'16
    • All
  • For Authors
  • Editorial Board
  • About
  • Issues
  • Blog
  • search
  • RSS feed (opens a modal with a link to feed)

RSS Feed

Enter the URL below into your favorite RSS reader.

http://localhost:20455/feed
ISSN 1944-9488
General
Vol. 5, Issue 4, 2008December 31, 2007 EDT

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

Heiner Ackermann, Alexander Skopalik,
math
https://doi.org/10.1080/15427951.2008.10129170
Internet Mathematics
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.

View more stats

Powered by Scholastica, the modern academic journal management system