1. LNCS: Vol;S. Aland,2006
2. Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., & Roughgarden, T. (2008). The price of stability for network design with fair cost allocation. SIAM Journal on Computing, 38(4), 1602–1623.
3. Awerbuch, B., Azar, Y., & Epstein, A. (2005). The price of routing unsplittable flow. In 37th ACM symposium on theory of computing (pp. 57–66), Baltimore, MD, USA, 22–24 May 2005.
4. Berenbrink, P., Goldberg, L. A., Goldberg, P. W., & Martin, R. (2006). Utilitarian resource assignment. Journal of Discrete Algorithms, 4, 567–587.
5. Czumaj, A. (2004). Selfish routing on the Internet. In Handbook of scheduling: algorithms, models, and performance analysis (pp. 517–542). Boca Raton: CRC Press, Chap. 42.