Competitive Routing over Time

13 years 6 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players allocate resources simultaneously and instantly. This is particularly unrealistic for many network routing scenarios, which are one of the prominent application scenarios of congestion games. In many networks load travels along routes over time and allocation of edges happens sequentially. In this paper we consider two frameworks that enhance network congestion games with a notion of time. We propose temporal network congestion games that use coordination mechanisms – local policies that allow to sequentialize traffic on the edges. In addition, we consider congestion games with time-dependent costs, in which travelling times are fixed but quality of service of transmission varies with load over time. We study existence and complexity properties of pure Nash equilibria and best-response strategies in both ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where WINE
Authors Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng
Comments (0)