research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:
TitleNetwork Load Games
Bibtex cite IDRACTI-RU1-2005-70
Booktitle 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005)
Series LNCS 3827
Year published 2005
Pages 809-818
Publisher Springer
We study network load games, a class of routing games in networks which generalize selÂsh routing games on networks consisting of parallel links. In these games, each user aims to route some traÂc from a source to a destination so that the maximum load she experiences in the links of the network she occupies is minimum given the routing decisions of other users. We present results related to the existence, complexity, and price of anarchy of Pure Nash Equilibria for several network load games. As corollaries, we present interesting new statements related to the complexity of computing equilibria for selÂsh routing games in net- works of restricted parallel links.
Caragiannis, Ioannis
Galdi, C.
Kaklamanis, Christos
isaac05a.pdf (main file)
Publication ID621