1. Christos H. Papadimitriou, Algorithms, games, and the internet, in: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8–12, 2001, Proceedings, 2001, pp. 1-3.
2. Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis, The structure and complexity of Nash equilibria for a selfish routing game, in: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8–13, 2002, Proceedings, 2002, pp. 123–134.
3. Vincent Conitzer, Tuomas Sandholm, Complexity results about Nash equilibria, in: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03, Acapulco, Mexico, August 9–15, 2003, 2003, pp. 765–771.
4. Alex Fabrikant, Christos H. Papadimitriou, Kunal Talwar, The complexity of pure Nash equilibria, in: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13–16, 2004, 2004, pp. 604–612.
5. Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis, Symmetry in network congestion games: Pure equilibria and anarchy cost, in: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6–7, 2005, Revised Papers, 2005, pp. 161–175.