1. Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. SIAM J. Comput. 40(5), 1211–1233 (2011)
2. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486–504 (1997)
3. Awerbuch, B., Yossi, A., Grove, E.F., Kao, M., Krishnan, P., Vitter, J.S.: Load balancing in the l$${}_{\text{p}}$$ norm. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 383–391 (1995)
4. Azar, Y., Naor, J., Rom, R.: The competitiveness of on-line assignments. In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms (SODA), pp. 203–210 (1992)
5. Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)