1. E. Koutsoupias, C. Papadimitriou, Worst-case equilibria, in: 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS ’99, Trier, Germany, 1999, pp. 404–413.
2. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, T. Roughgarden, The price of stability for network design with fair cost allocation, in: The 45th Annual IEEE Symposium on Foundations of Computer Science, Focs, Rome, Italy, 2004, pp. 59–73.
3. A.S. Schulz, N.S. Moses, On the performance of user equilibria in trafficnetworks, in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’03, Philadelphia, PA, USA, 2003, pp. 86–87.
4. B. Awerbuch, Y. Azar, A. Epstein, The price of routing unsplittable flow, in: The 37th Annual ACM Symposium on Theory of Computing, Stoc, Baltimore, Maryland, USA, 2005, pp. 57–66.
5. How bad is selfish routing?;Roughgarden;J. ACM,2002