IEEE/ACM Transactions on Networking (TON)
Scheduling independent tasks to reduce mean finishing-time (extended abstract)
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Bottleneck links, variable demand, and the tragedy of the commons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
(Almost) optimal coordination mechanisms for unrelated machine scheduling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the impact of combinatorial structure on congestion games
Journal of the ACM (JACM)
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Non-clairvoyant Scheduling Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Equilibria in Dynamic Selfish Routing
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Nash Equilibria and the Price of Anarchy for Flows over Time
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Coordination mechanisms for selfish scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Competitive online multicommodity routing
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Coalitions and dynamics in network routing games
Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
A Stackelberg strategy for routing flow over time
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Contention issues in congestion games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
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 travel 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 frameworks. In some cases our results can be used to characterize convergence for various distributed dynamics.