1. Christodoulou G, Koutsoupias E (2005) The price of anarchy of finite congestion games. In: Proceedings of the 37th ACM symposium on theory of computing (STOC '05). ACM, Baltimore, pp 67–73
2. Czumaj A, Vöcking B (2002) Tight bounds for worst-case equilibria. In: Proceedings of the 13th ACM-SIAM symposium on discrete algorithms (SODA '02). SIAM, San Francisco, pp 413–420
3. Even-Dar E, Kesselman A, Mansour Y (2003) Convergence time to nash equilibria. In: Proceedings of the 30th international colloquium on automata, languages and programming (ICALP '03). LNCS. Springer, Eindhoven, pp 502–513
4. Even-Dar E, Mansour Y (2005) Fast convergence of selfish rerouting. In: Proceedings of the 16th ACM-SIAM symposium on discrete algorithms (SODA '05). SIAM, Vancouver, pp 772–781
5. Fabrikant A, Papadimitriou C, Talwar K (2004) The complexity of pure nash equilibria. In: Proceedings of the 36th ACM symposium on theory of computing (STOC '04). ACM, Chicago