Tim Roughgarden

The AGT Book:

• My book Algorithmic Game Theory, co-edited with Noam Nisan, Eva Tardos, and Vijay Vazirani, was published by Cambridge University Press in October 2007.
• Thanks to our progressive-minded publisher, you can read the entire book online by clicking here (username=agt1user, password=camb2agt).
• Errata from the first two printings.

Teaching (2009-2010)

• Winter '10: CS161, Design and Analysis of Algorithms, Tuesdays/Thursdays 11 AM-12:15 PM in 370-370.
• Fall '09: CS369N, Advanced Algorithms: Beyond Worst-Case Analysis, Fridays 10 AM until around 12:30 PM.
• Archived graduate courses

Local Theory Events

• Bay Algorithmic Game Theory Symposium (BAGT), Berkeley, May 1, 2009.
• Bay Area Theory Symposium (BATS), Stanford, November 20, 2009.
• AFLB (i.e., our theory seminar) occurs during theory lunch, Thursdays at noon.

Some Recent Papers

• J. D. Hartline and T. Roughgarden, Simple versus Optimal Mechanisms, EC '09.
• S. Dughmi, T. Roughgarden, and M. Sundararajan, Revenue Submodularity, EC '09.
• D. Mosk-Aoyama and T. Roughgarden, Worst-Case Efficiency Analysis of Queueing Disciplines, ICALP '09.
• T. Roughgarden, Intrinsic Robustness of the Price of Anarchy, STOC '09.
• A. Ghosh, T. Roughgarden, and M. Sundararajan, Universally Utility-Maximizing Privacy Mechanisms, full version of STOC '09 paper.
• T. Roughgarden, Computing Equilibria: A Computational Complexity Perspective, invited survey for Economic Theory, 2009.
• A. Motskin, T. Roughgarden, P. Skraba, and L. Guibas, Lightweight Coloring and Desynchronization for Networks, INFOCOM '09.
• P. Dhangwatnotai, S. Dobzinski, S. Dughmi, and T. Roughgarden, Truthful Approximation Schemes for Single-Parameter Agents, full version of FOCS '08 paper.

Some Recent Talks

• Intrinsic Robustness of the Price of Anarchy, plenary lecture, Bellairs Workshop on Algorithmic Game Theory.
• Potentials and Approximation, Shapley Lecture, Third World Congress of the Game Theory Society.
• From Bayesian Auctions to Approximation Guarantees, invited lecture, Fourth Workshop on Ad Auctions.

Selected Older Research Publications (Full chronological list)

• A. Mehta, T. Roughgarden, and M. Sundararajan, Beyond Moulin Mechanisms, Games and Economic Behavior, 2009.
• T. Roughgarden and M. Sundararajan, Quantifying Inefficiency in Cost-Sharing Mechanisms, JACM '09.
• C. H. Papadimitriou and T. Roughgarden, Computing Correlated Equilibria in Multi-Player Games, JACM '08.
• A. Gupta, A. Kumar, M. Pal, and T. Roughgarden, Approximation Via Cost Sharing, JACM '07.
• T. Roughgarden, The Price of Anarchy is Independent of the Network Topology, JCSS '03.
• T. Roughgarden, Designing Networks for Selfish Users is Hard, JCSS '06.
• T. Roughgarden and E. Tardos, How Bad is Selfish Routing?, JACM '02.

Selected Expository Writings

• T. Roughgarden, Computing Equilibria: A Computational Complexity Perspective, invited survey for Economic Theory, 2009.
• T. Roughgarden, An Algorithmic Game Theory Primer, TCS '08 (invited survey).
• T. Roughgarden, Routing Games, Chapter 18 in Algorithmic Game Theory, 2007
• T. Roughgarden and E. Tardos, Introduction to the Inefficiency of Equilibria, Chapter 17 in Algorithmic Game Theory, 2007.
• T. Roughgarden, Selfish Routing and the Price of Anarchy (Survey), OPTIMA #74, 2007
• T. Roughgarden, Potential Functions and the Inefficiency of Equilibria (Survey), International Congress of Mathematicians, 2006.
• T. Roughgarden. Selfish Routing and the Price of Anarchy, MIT Press, 2005.

Music

• Back in the Stone Age I DJed at KZSU 90.1 FM.
• Top two reasons to live in the Bay Area: #1; #2.

Admin: