A few recomended papers

Load balancing

• A. Czumaj and B. Vöcking: Tight Bounds for Worst-Case Equilibria, in SODA 2002.
• Christodoulou, E. Koutsoupias, and A. Nanavati. Coordination mechanisms. In Automata, Languages and Programming: 31st International Colloquium (ICALP), pages 345--357, Turqu, Finland, 12--16 July 2004.  Pdf 

Quality of equlibria

• G. Christodoulou and E. Koutsoupias. On the price of anarchy and stability of correlated equilibria of linear congestion games. Submitted, 2005. Pdf 

Market equilibria

• Deng Xiaotie, C. H. Papadimitriou, Muli Safra  On the Complexity of Equilibria., STOC 02  
• N. Devanur, C. Papadimitriou, A. Saberi, and V. Vazirani ``Market Equilibrium via a Primal-Dual-Type Algorithm'', FOCS 2002.
• Kamal Jain: A Polynomial Time Algorithm for Computing an Arrow-Debreu Market Equilibrium for Linear Utilities, Appeared in FOCS 2004.

Cost-sharing

• Herve Moulin and Scott Shenker, "Serial Cost Sharing," Econometrica, vol. 60, no. 5, pp. 1009-1037, 1992.

• Scott Shenker Making Greed Work in Networks A Game Theoretic Analysis of Switch Switch Service Disciplines, SIGCOMM'95

• H. Moulin and S. Shenker: Strategyproof Sharing of Submodular Costs: budget balance versus efficiency

• K. Jain and V. Vazirani  Applications of Approximation Algorithms to Cooperative Games, STOC 2001

• Approximation and Collusion in Multicast Cost Sharing," Games and Economic Behavior 47 (2004), pp. 36-71. (Abstract appeared in Proc. of ACM EC'01.) (by Joan Feigenbaum, Aaron Archer, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker) AFKSS.ps, AFKSS.pdf

• Hardness Results for Multicast Cost Sharing," Theoretical Computer Science 304 (2003), pp. 215-236. (Extended Abstract appeared in Proc. of FST-TCS'02.) (by Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, and Scott Shenker) FKSS2.ps, FKSS2.pdf

• "Sharing the Cost of Multicast Transmissions," Journal of Computer and System Sciences 63 (2001), pp. 21-41. (Preliminary version appeared in Proc. of ACM STOC'00.) (by Joan Feigenbaum, Christos Papadimitriou, and Scott Shenker) FPS.ps, FPS.pdf

Braess paradox

• T. Roughgarden. On the Severity of Braess's Paradox: Designing Networks for Selfish Users Is Hard.
• H. Lin, T. Roughgarden, E. Tardos, and A. Walkover. Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability.

Correlated equilibrium

• Graphical Models for Game Theory, by M. Kearns, M. Littman, and S. Singh. 2001. In Proceedings of UAI 2001.
• C. Papadimitriou, and T. Roughgarden. Computing equilibria in multiplayer games.
• C. Papadimitriou, Computing correlated equilibria in multiplayer games. 

Routing with tolls

• Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games (L. Fleischer K. Jain and M. Mahdian). 45th Annual Symposium of the Foundations of Computer Science (FOCS), , October, 2004, 277-285. ps.gz, pdf.