Network load games

Authors:
Ioannis Caragiannis;Clemente Galdi;Christos Kaklamanis
Affiliations:
Research Academic Computer Technology Institute, Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;,Research Academic Computer Technology Institute, Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;Research Academic Computer Technology Institute, Department of Computer Engineering and Informatics, University of Patras, Rio, Greece
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 10
Cited 4

A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
How bad is selfish routing?

Journal of the ACM (JACM)
Approximation Algorithms for Single-Source Unsplittable Flow

SIAM Journal on Computing
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Single-source unsplittable flow

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The complexity of pure Nash equilibria

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing Nash equilibria for scheduling on restricted parallel links

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Nashification and the coordination ratio for a selfish routing game

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Wardrop equilibria and price of stability for bottleneck games with splittable traffic

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Bottleneck links, variable demand, and the tragedy of the commons

Networks
On the hardness of network design for bottleneck routing games

SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On the hardness of network design for bottleneck routing games

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims to route some traffic 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 selfish routing games in networks of restricted parallel links.