1. Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: 45th Symposium on Foundations of Computer Science (FOCS 2004), Rome, Italy, 17–19 October 2004, Proceedings, pp. 295–304. IEEE Computer Society (2004)
2. Axhausen, K., Nagel, K., Horni, A. (eds.): Multi-Agent Transport Simulation MATSim. Ubiquity Press, London (2016)
3. Blum, A., Hajiaghayi, M., Ligett, K., Roth, A.: Regret minimization and the price of total anarchy. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 373–382 (2008)
4. Cao, Z., Chen, B., Chen, X., Wang, C.: A network game of dynamic traffic. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 695–696 (2017)
5. Lecture Notes in Computer Science;R Cominetti,2011