Nonadaptive Selfish Routing with Online Demands

10 years 5 months ago
Nonadaptive Selfish Routing with Online Demands
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players reroute their flow and form a new equilibrium upon arrival of a new demand. In our model, demands arrive in n sequential games. In each game, the new demands form a Nash equilibrium and their routings remain unchanged afterwards. We study the problem both with nonatomic and atomic player types and with continuous and nondecreasing latency functions on the edges. For polynomial latency functions, we give constant upper and lower bounds on the competitive ratio of the resulting online routing in terms of the maximum degree, the number of games and in the atomic setting the number of players. In particular, for nonatomic players and affine latency functions we show that the competitive ratio is at most 4n n+2 . Finally, we present improved upper bounds for the special case of two nodes connected by parallel arcs.
Tobias Harks, László A. Végh
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2007
Where CAAN
Authors Tobias Harks, László A. Végh
Comments (0)