Tim Roughgarden

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Timothy Avelin Roughgarden
Fields Computer Science, Game Theory
Institutions Stanford University
Alma mater Cornell University
Thesis Selfish routing (2002)
Doctoral advisor Éva Tardos

Timothy Avelin Roughgarden is a 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 four-part algorithms specialization on Coursera.[3]

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 Presidential Early Career Award for Scientists and Engineers in 2007, 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. He received a Guggenheim Fellowship in 2017.

Selected publications[edit]

  • Roughgarden, Tim (2016). Twenty Lectures on Algorithmic Game Theory. Cambridge University Press. 
  • 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 


  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 Specialization". https://www.coursera.org. Coursera Inc. Retrieved 17 May 2017.  External link in |website= (help)

External links[edit]