1. Anderson, E.J., Philpott, A.B.: Optimisation of flows in networks over time. In: Kelly, F.P. (ed.) Probability, Statistics and Optimisation, pp. 369–382. Wiley, New York (1994)
2. Bhaskar, U., Fleischer, L., Anshelevich, E.: A stackelberg strategy for routing flow over time. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 192–201 (2011)
3. Brezis, H.: Functional Analysis, Sobolev Spaces and Partial Differential Equations. Springer, New York (2010)
4. Facchinei, F., Pang, J.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I. Springer, New York (2003)
5. Fleischer, L., Tardos, E.: Efficient continuous-time dynamic network flow algorithms. Operations Research 23(3-5), 71–80 (1998)