Tim Roughgarden

22.1k total citations · 4 hit papers
179 papers, 9.7k citations indexed

About

Tim Roughgarden is a scholar working on Management Science and Operations Research, Economics and Econometrics and Computer Networks and Communications. According to data from OpenAlex, Tim Roughgarden has authored 179 papers receiving a total of 9.7k indexed citations (citations by other indexed papers that have themselves been cited), including 122 papers in Management Science and Operations Research, 61 papers in Economics and Econometrics and 44 papers in Computer Networks and Communications. Recurrent topics in Tim Roughgarden's work include Auction Theory and Applications (90 papers), Game Theory and Applications (66 papers) and Game Theory and Voting Systems (45 papers). Tim Roughgarden is often cited by papers focused on Auction Theory and Applications (90 papers), Game Theory and Applications (66 papers) and Game Theory and Voting Systems (45 papers). Tim Roughgarden collaborates with scholars based in United States, United Kingdom and Israel. Tim Roughgarden's co-authors include Éva Tardos, Noam Nisan, Vijay V. Vazirani, Jason D. Hartline, Christos H. Papadimitriou, Yevgeniy Dodis, Richard Cole, Mukund Sundararajan, Arpita Ghosh and Jon Kleinberg and has published in prestigious journals such as IEEE Transactions on Automatic Control, Communications of the ACM and Energy Policy.

In The Last Decade

Tim Roughgarden

174 papers receiving 9.4k citations

Hit Papers

Algorithmic Game Theory 2002 2026 2010 2018 2007 2002 2007 2007 400 800 1.2k
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Algorithmic Game Theory
    2007 1.4k citations Éva Tardos, Michael Kearns et al. profile →
  2. How bad is selfish routing?
    2002 969 citations Tim Roughgarden, Éva Tardos Journal of the ACM profile →
  3. Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria
    2007 760 citations Tim Roughgarden, Éva Tardos et al. profile →
  4. Algorithmic Game Theory: Computing in Games
    2007 759 citations Tim Roughgarden, Éva Tardos et al. profile →

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Tim Roughgarden 5.7k 2.9k 2.8k 1.4k 1.1k 179 9.7k
Yoav Shoham 3.3k 0.6× 2.4k 0.8× 1.1k 0.4× 4.7k 3.3× 982 0.9× 169 10.2k
Tüomas Sandholm 6.3k 1.1× 2.6k 0.9× 2.8k 1.0× 4.1k 2.8× 1.7k 1.6× 326 10.6k
J. George Shanthikumar 3.8k 0.7× 1.3k 0.4× 800 0.3× 663 0.5× 563 0.5× 323 12.2k
Kevin Leyton‐Brown 2.2k 0.4× 1.7k 0.6× 696 0.2× 3.1k 2.2× 615 0.6× 124 6.9k
Ramesh Johari 1.7k 0.3× 2.2k 0.8× 704 0.3× 486 0.3× 637 0.6× 118 5.4k
Vahab Mirrokni 1.8k 0.3× 2.1k 0.7× 508 0.2× 1.5k 1.0× 723 0.7× 220 6.2k
Michael P. Wellman 3.2k 0.6× 1.6k 0.5× 979 0.3× 3.0k 2.1× 838 0.8× 231 6.7k
Jason D. Hartline 3.0k 0.5× 1.3k 0.4× 804 0.3× 600 0.4× 1.5k 1.4× 88 4.2k
Robert Kleinberg 2.4k 0.4× 2.2k 0.8× 383 0.1× 1.1k 0.8× 608 0.6× 144 4.8k
Yi Peng 2.8k 0.5× 516 0.2× 908 0.3× 2.3k 1.6× 280 0.3× 143 7.8k

Countries citing papers authored by Tim Roughgarden

Since Specialization
Citations

This map shows the geographic impact of Tim Roughgarden's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tim Roughgarden with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tim Roughgarden more than expected).

Fields of papers citing papers by Tim Roughgarden

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tim Roughgarden. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tim Roughgarden. The network helps show where Tim Roughgarden may publish in the future.

Co-authorship network of co-authors of Tim Roughgarden

This figure shows the co-authorship network connecting the top 25 collaborators of Tim Roughgarden. A scholar is included among the top collaborators of Tim Roughgarden based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tim Roughgarden. Tim Roughgarden is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Dütting, Paul, et al.. (2019). The Complexity of Contracts. SIAM Journal on Computing. 50(1). 211–254. 1 indexed citations
2.
Roughgarden, Tim, et al.. (2018). An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization. Conference on Learning Theory. 1307–1325. 4 indexed citations
3.
Feldman, Michal, et al.. (2017). Pricing Identical Items.. arXiv (Cornell University). 1 indexed citations
4.
Morgenstern, Jamie & Tim Roughgarden. (2016). Learning Simple Auctions. Conference on Learning Theory. 1298–1318. 5 indexed citations
5.
Dughmi, Shaddin, Tim Roughgarden, & Qiqi Yan. (2016). Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding. Journal of the ACM. 63(4). 1–33. 4 indexed citations
6.
Globerson, Amir, et al.. (2015). How Hard is Inference for Structured Prediction. International Conference on Machine Learning. 2181–2190. 6 indexed citations
7.
Morgenstern, Jamie & Tim Roughgarden. (2015). On the Pseudo-Dimension of Nearly Optimal Auctions. Neural Information Processing Systems. 28. 136–144. 35 indexed citations
8.
Boneh, Dan, Tim Roughgarden, & Joan Feigenbaum. (2013). Proceedings of the forty-fifth annual ACM symposium on Theory of computing. 3 indexed citations
9.
Roughgarden, Tim & Michael Kearns. (2013). Marginals-to-Models Reducibility. Neural Information Processing Systems. 26. 1043–1051. 1 indexed citations
10.
Rexford, Jennifer, Tim Roughgarden, Margo Seltzer, et al.. (2013). Computer/Information Science. University of Twente Research Information. 53(5). 16–25. 5 indexed citations
11.
Roughgarden, Tim & Florian Schoppmann. (2011). Local smoothness and the price of anarchy in atomic splittable congestion games. Symposium on Discrete Algorithms. 255–267. 27 indexed citations
12.
Shoham, Yoav, Yan Chen, & Tim Roughgarden. (2011). Proceedings of the 12th ACM conference on Electronic commerce. 13 indexed citations
13.
Roth, Aaron & Tim Roughgarden. (2009). The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries. arXiv (Cornell University). 10 indexed citations
14.
Cole, Richard, Yevgeniy Dodis, & Tim Roughgarden. (2006). Bottleneck links, variable demand, and the tragedy of the commons. Symposium on Discrete Algorithms. 668–677. 9 indexed citations
15.
Roughgarden, Tim. (2005). Selfish routing with atomic players. Symposium on Discrete Algorithms. 1184–1185. 36 indexed citations
16.
Lin, Henry, Tim Roughgarden, & Éva Tardos. (2004). A stronger bound on Braess's Paradox. Symposium on Discrete Algorithms. 340–341. 13 indexed citations
17.
Roughgarden, Tim. (2004). The maximum latency of selfish routing. Symposium on Discrete Algorithms. 980–981. 24 indexed citations
18.
Roughgarden, Tim. (2002). How unfair is optimal routing. Symposium on Discrete Algorithms. 203–204. 42 indexed citations
19.
Kumar, Amit, Anupam Gupta, & Tim Roughgarden. (2002). A Constant-Factor Approximation Algorithm for the Multicommodity. 333. 17 indexed citations
20.
Roughgarden, Tim & Éva Tardos. (2002). How bad is selfish routing?. Journal of the ACM. 49(2). 236–259. 969 indexed citations breakdown →

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Yoav Shoham Breakdown of academic impact, for papers by Tüomas Sandholm Breakdown of academic impact, for papers by J. George Shanthikumar Breakdown of academic impact, for papers by Kevin Leyton‐Brown Breakdown of academic impact, for papers by Ramesh Johari Breakdown of academic impact, for papers by Vahab Mirrokni Breakdown of academic impact, for papers by Michael P. Wellman Breakdown of academic impact, for papers by Jason D. Hartline Breakdown of academic impact, for papers by Robert Kleinberg Breakdown of academic impact, for papers by Yi Peng
Rankless by CCL
2026