Tim Roughgarden

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Timothy Avelin Roughgarden
Residence USA
Fields Computer Science
Institutions Stanford University
Alma mater Cornell University

Timothy Avelin Roughgarden is a computer scientist at Stanford University.[1] He received his Ph.D. at Cornell University in 2002.[2] Roughgarden teaches a series of two popular algorithms courses on Coursera namely Algorithms: Design and Analysis, Part 1 and Part 2[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[edit]

  • 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[edit]

External links[edit]