Martin Hoefer, Vahab Mirrokni, Heiko Röglin, Shang-Hua Teng
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
| Download: |
|