Tim Roughgarden headshot

Tim Roughgarden

Professor
School of Mathematics

Algorithmic Game Theory

Affiliation

Mathematics

Field of study

Algorithmic Game Theory

Widely regarded as a field-defining figure in algorithmic game theory, Tim Roughgarden works at the interface of computer science and economics, and on the design, analysis, and limitations of algorithms. His research spans many application areas, including networks, auctions, markets, and blockchain protocols. He has written or edited numerous books and monographs, including Twenty Lectures on Algorithmic Game Theory (Cambridge University Press, 2016), Beyond the Worst-Case Analysis of Algorithms (Cambridge University Press, 2021), and the Algorithms Illuminated series (Soundlikeyourself Publishing, 2017–2022).

Visits

Faculty
School of Mathematics

Degrees

Cornell University
Ph.D.
2002
Cornell University
M.S.
2002
Stanford University
M.S.
1998
Stanford University
B.S.
1997

Honors

2026
Member of the American Academy of Arts and Sciences
2023
Fellow of the Association for Computing Machinery
2019
Fellow of the Game Theory Society
2016
Kalai Prize in Game Theory and Computer Science
2012
Gödel Prize
2009
ACM Grace Murray Hopper Award

Appointments

Columbia University
2019–2026
Professor of Computer Science
Stanford University
2017–2018
Professor of Computer Science and (by courtesy) Management Science and Engineering
London School of Economics
2017–2018
Visiting Professor
Stanford University
2011–2017
Associate Professor of Computer Science and (by courtesy) Management Science and Engineering
Stanford University
2004–2011
Assistant Professor of Computer Science and (by courtesy) Management Science and Engineering