Tradeoffs and Average-Case Equilibria in Selfish Routing

We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by choosing one of several parallel links that have transmission speeds. A player desires to minimize his own transmission time (latency). We study the quality of Nash equilibria of the game, in which no player can decrease his latency by unilaterally changing his link. In this paper we treat two important aspects of network-traffic management: the influence of the total traffic upon network performance and fluctuations in the lengths of the messages. We introduce a probabilistic model where message lengths are random variables and evaluate the expected price of anarchy of the game for various social cost functions. For total latency social cost, which was only scarcely considered in previous work so far, we show that the price of anarchy is n t , where n is the number of players and t the total message-length...

• Type: Conference
• Year: 2007
• Where: ESA
• Authors: Martin Hoefer, Alexander Souza
• Keywords: Algorithms, Anarchy, ESA 2007, Nash Equilibria, Total Latency