World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
69
Citations
24440
World Ranking
1940
National Ranking
982

Research.com Recognitions

  • 2017 - Fellow of John Simon Guggenheim Memorial Foundation
  • 2009 - ACM Grace Murray Hopper Award For his research combining computer science and game theory to analyze network routing among self-interested parties.
  • 2006 - Fellow of Alfred P. Sloan Foundation

Overview

Tim Roughgarden is affiliated with Columbia University in the United States. Their research spans multiple fields with a focus on computer science, decision sciences, and economics, econometrics, and finance. Roughgarden's work also specializes in subfields such as management science and operations research, artificial intelligence, economics and econometrics, computer networks and communications, and finance.

The scientist's research topics cover a broad range of areas including auction theory and applications, blockchain technology applications and security, economic theories and models, financial markets and investment strategies, machine learning and algorithms, distributed systems and fault tolerance, as well as optimization and search problems.

Tim Roughgarden has authored papers published primarily in the venue arXiv (Cornell University) with 30 publications, alongside additional works appearing in other outlets such as Leibniz-Zentrum für Informatik (Schloss Dagstuhl), Operations Research, Communications of the ACM, and SIAM Journal on Computing.

The most recent papers include:

  • Automated Market Making and Loss-Versus-Rebalancing, 2022, arXiv (Cornell University)
  • Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP-1559, 2020, arXiv (Cornell University)
  • Data-driven algorithm design, 2020, Communications of the ACM
  • Automated Market Making and Arbitrage Profits in the Presence of Fees, 2023, arXiv (Cornell University)
  • Resource Pools and the CAP Theorem, 2020, arXiv (Cornell University)

Roughgarden frequently collaborates with several co-authors, including:

  • Andrew Lewis-Pye
  • Eric Neyman
  • Jason Milionis
  • Ciamac C. Moallemi
  • Maryam Bahrani

In addition to journal and conference papers, Roughgarden has contributed to book publications, including a title titled Algorithms for NP-hard problems published by the Japan Society of Medical Entomology and Zoology in 2020.

The scientist has received several awards:

  • Fellow of John Simon Guggenheim Memorial Foundation, 2017
  • ACM Grace Murray Hopper Award, 2009, awarded for research combining computer science and game theory to analyze network routing among self-interested parties
  • Fellow of Alfred P. Sloan Foundation, 2006

Best Publications

  • How bad is selfish routing

    Tim Roughgarden;Éva Tardos

  • Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria

    Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani

  • Algorithmic Game Theory: Computing in Games

    Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani

  • The Price of Stability for Network Design with Fair Cost Allocation

    Elliot Anshelevich;Anirban Dasgupta;Jon Kleinberg;Éva Tardos

  • Universally Utility-maximizing Privacy Mechanisms

    Arpita Ghosh;Tim Roughgarden;Mukund Sundararajan

  • Intrinsic Robustness of the Price of Anarchy

    Tim Roughgarden

  • Stackelberg Scheduling Strategies

    Tim Roughgarden

  • Computing correlated equilibria in multi-player games

    Christos H. Papadimitriou;Tim Roughgarden

  • Bounding the inefficiency of equilibria in nonatomic congestion games

    Tim Roughgarden;Éva Tardos

  • Pricing network edges for heterogeneous selfish users

    Richard Cole;Yevgeniy Dodis;Tim Roughgarden

  • Interactive privacy via the median mechanism

    Aaron Roth;Tim Roughgarden

  • The price of anarchy is independent of the network topology

    Tim Roughgarden

  • The sample complexity of revenue maximization

    Richard Cole;Tim Roughgarden

  • Selfish routing

    Eva Tardos;Timothy Avelin Roughgarden

  • Part III: routers with very small buffers

    Mihaela Enachescu;Yashar Ganjali;Ashish Goel;Nick McKeown

  • On the severity of Braess's paradox: designing networks for selfish users is hard

    Tim Roughgarden

  • Network Design with Weighted Players

    Ho-Lin Chen;Tim Roughgarden

  • Optimal mechanism design and money burning

    Jason D. Hartline;Tim Roughgarden

  • Simpler and better approximation algorithms for network design

    Anupam Gupta;Amit Kumar;Tim Roughgarden

  • Routers with Very Small Buffers

    M. Enachescu;Y. Ganjali;A. Goel;N. McKeown

Frequent Co-Authors

Éva Tardos
Éva Tardos Cornell University
Noam Nisan
Noam Nisan Hebrew University of Jerusalem
Richard Cole
Richard Cole New York University
Gregory Valiant
Gregory Valiant Stanford University
Vijay V. Vazirani
Vijay V. Vazirani University of California, Irvine
Michal Feldman
Michal Feldman Tel Aviv University
Jason D. Hartline
Jason D. Hartline Northwestern University
Yevgeniy Dodis
Yevgeniy Dodis New York University
C. Seshadhri
C. Seshadhri University of California, Santa Cruz
Aaron Roth
Aaron Roth University of Pennsylvania

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring related online degrees in the USA can unlock diverse career pathways within Computer Science. For those seeking quick entry points, 1 year associate degree programs online allow you to gain practical skills and credentials in less time. These fast-track programs are an excellent launchpad for entry-level tech roles.

If you already have a foundation and want to boost your qualifications, consider pursuing some of the fastest online master's degree programs. These can be completed efficiently, helping professionals quickly enhance their expertise and marketability. Alternatively, focusing on the most worthwhile masters degrees ensures your studies are aligned with in-demand skills and industry needs.

Additionally, industry-recognized certifications that pay well provide a practical shortcut to top-paying jobs. Many of these certifications can complement your degree studies, further boosting employability. Combining online degrees and targeted certifications can maximize both learning and earning potential in the evolving field of Computer Science.

Best Scientists Citing Tim Roughgarden

Trending Scientists

Recently Published Articles