1. Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. Theory Comput. 4(1), 77–109 (2008)
2. Ashlagi, I., Krysta, P., Tennenholtz, M.: Social context games. In: WINE, pp. 675–683 (2008)
3. Awerbuch, B., Azar, Y., Epstein, A.: Large the price of routing unsplittable flow. In: Gabow, H.N., Fagin, R. (eds.) STOC, pp. 57–66. ACM, New York (2005)
4. Babaioff, M., Kleinberg, R., Papadimitriou, C.H.: Congestion games with malicious players. In: MacKie-Mason, J.K., Parkes, D.C., Resnick, P. (eds.) ACM Conference on Electronic Commerce, pp. 103–112. ACM, New York (2007)
5. Beier, R., Czumaj, A., Krysta, P., Vöcking, B.: Computing equilibria for congestion games with (im)perfect information. In: Munro, J.I. (ed.) SODA, pp. 746–755. SIAM, Philadelphia (2004)