Braess's paradox for flows over time
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Nash Equilibria and the Price of Anarchy for Flows over Time
Theory of Computing Systems - Special Issue: Algorithmic Game Theory
A Stackelberg strategy for routing flow over time
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient continuous-time dynamic network flow algorithms
Operations Research Letters
A competitive strategy for routing flow over time
ACM SIGecom Exchanges
| Hi-index | 0.00 |
Network flows that vary over time arise naturally when modeling rapidly evolving systems such as the Internet. In this paper, we continue the study of equilibria for flows over time in the single-source single-sink deterministic queuing model proposed by Koch and Skutella. We give a constructive proof for the existence and uniqueness of equilibria for the case of a piecewise constant inflow rate, through a detailed analysis of the static flows obtained as derivatives of a dynamic equilibrium.