Timothy Avelin Roughgarden | |
---|---|
Fields | Computer Science, Game Theory |
Institutions | Stanford University |
Alma mater | Cornell University |
Thesis | Selfish routing (2002) |
Doctoral advisor | Éva Tardos |
Website http://theory.stanford.edu/~tim/ |
Timothy Avelin Roughgarden is an associate professor in the Computer Science and Management Science and Engineering Departments at Stanford University. Tim received his Ph.D. at Cornell University in 2002, where his PhD was supervised by Éva Tardos.
Roughgarden teaches a popular two-part algorithms course on Coursera.
Roughgarden’s work is concerned with game theoretic questions in computer science. He received the Danny Lewin award at 2002 for the best student paper. He received the Grace Murray Hopper Award in 2009 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.