Tim Roughgarden

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.^[1] Tim received his Ph.D. at Cornell University in 2002, where his PhD was supervised by Éva Tardos.^[2]

Roughgarden teaches a popular two-part Algorithms course on Coursera.^[3][4]

Roughgarden’s work is concerned with game theoretic questions in computer science. He received the Danny Lewin award at STOC 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.

Selected publications

• Roughgarden, Tim (2005). Selfish Routing and the Price of Anarchy. MIT Press.
• Roughgarden, Tim; Tardos, Éva (March 2002). "How Bad is Selfish Routing?". Journal of the ACM 49 (2): 236–259. doi:10.1145/506147.506153.
• Roughgarden, Tim (2002), "The price of anarchy is independent of the network topology", Proceedings of the 34th Symposium on Theory of Computing, pp. 428–437

References

1. "Tim Roughgarden's Homepage". http://theory.stanford.edu. Retrieved 6 July 2015. External link in |website= (help)
2. "Tim Roughgarden's Profile - Stanford Profiles". http://soe.stanford.edu. Stanford University. Retrieved 6 July 2015. External link in |website= (help)
3. "Algorithms: Design and Analysis, Part 1". https://www.coursera.org. Coursera Inc. Retrieved 6 July 2015. External link in |website= (help)
4. "Algorithms: Design and Analysis, Part 2". https://www.coursera.org. Coursera Inc. Retrieved 6 July 2015. External link in |website= (help)

External links

• Mathematics Genealogy Project