2008
- J. D. Hartline and T. Roughgarden,
Optimal Mechanism Design
and Money Burning, STOC '08.
- S. Dobzinski, A. Mehta, T. Roughgarden, and M. Sundararajan,
Is Shapley Cost Sharing Optimal?, SAGT '08.
- S. Chawla and T. Roughgarden,
Bertrand Competition in Networks, SAGT '08.
- H. Chen, T. Roughgarden, and G. Valiant,
Designing Networks with Good Equilibria, SODA '08.
- R. Krauthgamer and T. Roughgarden,
Metric Clustering via Consistent Labeling, SODA '08.
2007
- N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani (eds.),
Algorithmic Game Theory, Cambridge University Press.
- T. Roughgarden,
Routing Games, Chapter 18
in Algorithmic Game Theory.
- T. Roughgarden and E. Tardos,
Introduction to the Inefficiency of Equilibria, Chapter 17
in Algorithmic Game Theory.
- D. Mosk-Aoyama, T. Roughgarden, and D. Shah,
Fully Distributed Algorithms for Convex Optimization,
DISC '07.
- M. Haviv and T. Roughgarden,
The Price of Anarchy in an Exponential Multi-Server,
ORL '07.
- T. Roughgarden,
Selfish Routing and the Price of Anarchy (Survey),
OPTIMA #74.
- T. Roughgarden and M. Sundararajan,
Optimal Efficiency Guarantees for Network Design Mechanisms, IPCO '07.
- A. Mehta, T. Roughgarden, and M. Sundararajan,
Beyond Moulin Mechanisms, EC '07.
- T. Roughgarden and M. Sundararajan,
Is Efficiency Expensive?, 3rd Workshop on Sponsored Search.
2006
- S. Chawla, T. Roughgarden, and M. Sundararajan,
Optimal Cost-Sharing Mechanisms for Steiner Forest Problems, WINE '06. Bibtex
- S. Chawla and T. Roughgarden,
Single-Source Stochastic Routing, APPROX '06.
Bibtex
- T. Roughgarden,
Potential Functions and the Inefficiency of Equilibria (Survey), ICM '06.
- H. Chen and T. Roughgarden,
Network Design with Weighted Players, SPAA '06.
Bibtex
- T. Roughgarden and M. Sundararajan,
Quantifying Inefficiency in Cost-Sharing Mechanisms, STOC '06.
Bibtex
- G. Valiant and T. Roughgarden,
Braess's Paradox in Large Random Graphs, EC '06.
Bibtex
- R. Cole, Y. Dodis, and T. Roughgarden,
Bottleneck Links, Variable Demand, and the Tragedy of the
Commons, SODA '06.
Bibtex
- M. Saha, G. Sanchez-Ante, T. Roughgarden, and J.C. Latombe,
Planning Tours of Robotic Arms Among Partitioned Goals, IJRR '06.
Bibtex
2005
- T. Roughgarden.
Selfish Routing and the Price of Anarchy, MIT Press.
- T. Roughgarden,
An Interview with Vladimir Trifonov (2005 Danny Lewin Best Student Paper Award Winner), SIGACT News '05.
- M. Enachescu, Y. Ganjali, A. Goel, N. McKeown, and
T. Roughgarden,
Routers with Very Small Buffers, CCR '05.
INFOCOM '06 version. Bibtex
- H. Lin, T. Roughgarden, E. Tardos, and A. Walkover, Braess's Paradox, Fibonacci Numbers, and
Exponential Inapproximability, ICALP '05. Bibtex
- T. Roughgarden, Selfish Routing with Atomic
Players, SODA '05. Bibtex Erratum
- C. Papadimitriou and T. Roughgarden, Computing Equilibria in Multi-Player
Games, SODA '05. Bibtex
- Journal version, also includes Christos's STOC '05 paper. To appear in JACM.
2004
- E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos,
T. Wexler, and T. Roughgarden, The Price
of Stability for Network Design
with Fair Cost Allocation, FOCS '04. Bibtex
- T. Roughgarden and E. Tardos, Bounding the Inefficiency of Equilibria in
Nonatomic Congestion Games, Games and Economic Behavior.
- T. Roughgarden, The Maximum Latency of Selfish
Routing, SODA '04. Bibtex
- H. Lin, T. Roughgarden, and E. Tardos,
A Stronger Bound on Braess's
Paradox, SODA '04. Bibtex
2003
- A. Gupta, A. Kumar, M. Pal, and T. Roughgarden, Approximation Via Cost Sharing, FOCS '03.
- A. Gupta, A. Kumar, and T. Roughgarden,
Simpler and Better
Approximation Algorithms for
Network Design, STOC '03. Bibtex
- R. Cole, Y. Dodis, and T. Roughgarden, Pricing Network Edges for Heterogeneous Selfish Users, STOC '03. Bibtex
- R. Cole, Y. Dodis, and T. Roughgarden, How Much Can Taxes Help Selfish
Routing?, EC '03/JCSS '06. Bibtex
-
Survey of EC '03 and STOC '03 pricing papers, from
P2PECON '03.
2002
- T. Roughgarden,
Selfish Routing, PhD Thesis,
Cornell University.
- A. Kumar, A. Gupta, and T. Roughgarden,
A Constant-Factor Approximation
Algorithm for
the Multicommodity Rent-or-Buy Problem, FOCS '02.
Bibtex
- T. Roughgarden,
The Price of Anarchy is Independent
of the Network Topology, STOC '02/JCSS '03. Bibtex
- A. Hoffman, K. Jenkins, and T. Roughgarden,
On a Game in Directed Graphs, IPL '02. Bibtex
- T. Roughgarden,
How Unfair is Optimal
Routing?, SODA '02. Bibtex
2001
2000