Timothy Avelin Roughgarden | |
---|---|
![]() Roughgarden in 2022 | |
Born | July 20, 1975 |
Alma mater | |
Known for | Contributions to Selfish Routing in the context of Computer Science |
Awards |
|
Scientific career | |
Fields | Computer Science, Game Theory |
Institutions | |
Thesis | Selfish routing (2002) |
Doctoral advisor | Éva Tardos |
Website | http://timroughgarden.org/ |
Timothy Avelin Roughgarden (born July 20, 1975) is an American computer scientist and a professor of Computer Science at Columbia University.[1] Roughgarden's work deals primarily with game theoretic questions in computer science.
Roughgarden received his Ph.D. from Cornell University in 2002, under the supervision of Éva Tardos.[2] He did a postdoc at University of California, Berkeley in 2004. From 2004 to 2018, Roughgarden was a professor at the Computer Science department at Stanford University working on algorithms and game theory. Roughgarden teaches a four-part algorithms specialization on Coursera.[3]
He received the Danny Lewin award at STOC 2002 for the best student paper. He received the Presidential Early Career Award for Scientists and Engineers in 2007,[4] the Grace Murray Hopper Award in 2009,[5] and the Gödel Prize in 2012 for his work on routing traffic in large-scale communication networks to optimize performance of a congested network.[6][7] He received a Guggenheim Fellowship in 2017[8][9] and the Kalai Prize in 2016.
Roughgarden is a co-editor of the 2016 textbook Algorithmic Game Theory, as well as the author of two chapters (Introduction to the Inefficiency of Equilibria and Routing Games).[10][11]
{{cite book}}
: CS1 maint: multiple names: authors list (link)
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search