Some Recent Results in Algorithmic Game Theory

  • Christos Papadimitriou
Conference paper

DOI: 10.1007/978-3-540-92185-1_9

Volume 5385 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Papadimitriou C. (2008) Some Recent Results in Algorithmic Game Theory. In: Papadimitriou C., Zhang S. (eds) Internet and Network Economics. WINE 2008. Lecture Notes in Computer Science, vol 5385. Springer, Berlin, Heidelberg

Abstract

There are three major trends in the field of Algorithmic Game Theory: computational mechanism design, the price of anarchy, and the computation of equilibria; this talk describes one recent result in each. We show computational complexity lower bounds on truthful and approximately efficient mechanisms; we revisit the Roughgarden-Tardos result on selfish routing when routing decisions are made by the nodes, not the flows; and we show that Nash equilibria can be approximated well in several broad, unexpected, and useful classes of games. (Joint work with Costis Daskalakis, Michael Schapira, Yaron Singer, and Greg Valiant).

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Christos Papadimitriou
    • 1
  1. 1.UC Berkeley