Tim Roughgarden
- Assistant professor in the Computer
Science
and (by courtesy)
Management Science and Engineering
Departments at Stanford
University.
Research interests: Algorithms, Microeconomics, Networks.
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)
Local Theory Events
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
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.
Tim Roughgarden
Stanford University
Computer Science Department
462 Gates Building
353 Serra Mall
Stanford, CA 94305
P:(650)724-9147
F:(650)725-4671
tim@cs.stanford.edu
Admin:
Wendy Cardamone
Stanford University
Computer Science Department
461 Gates Building
353 Serra Mall
Stanford, CA 94305
P:(650)725-2340
F:(650)725-4671
wendyc@cs.stanford.edu