Sneha Girap (Editor)

Tim Roughgarden

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Institutions
  
Stanford University

Thesis
  
Selfish routing (2002)

Role
  
Computer scientist

Books
  
Algorithmic Game Theory

Alma mater
  
Cornell University

Name
  
Tim Roughgarden

Doctoral advisor
  
Eva Tardos

Awards
  
Grace Murray Hopper Award

Tim Roughgarden Tim Roughgarden39s Homepage
Education
  
University of California, Berkeley, Stanford University, Cornell University

Fields
  
Computer Science, Game theory

Similar
  
Eva Tardos, Noam Nisan, Grace Hopper

Tim roughgarden intrinsic robustness of the price of anarchy


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 Eva Tardos.

Contents

Tim Roughgarden httpscapstanfordeduprofilesviewImageprofil

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 STOC 2002 for the best student paper. He received the Grace Murray Hopper Award in 2009 and the Godel Prize in 2012 for his work on routing traffic in large-scale communication networks to optimize performance of a congested network.

Algorithmic Game Theory, Lecture 1 (Introduction)


Selected publications

  • Roughgarden, Tim (2005). Selfish Routing and the Price of Anarchy. MIT Press. 
  • Roughgarden, Tim; Tardos, Eva (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

    Tim Roughgarden Wikipedia
    (Text) CC BY-SA


    Similar Topics