Network Load Games

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.

• Type: Conference
• Year: 2005
• Where: ISAAC
• Authors: Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
• Keywords: ISAAC 2005, Network Load Games, Routing Games, Selfish Routing Games