Jump to content

Tim Roughgarden

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Shrinkydinks (talk | contribs) at 05:18, 20 January 2020 (added citation for 2012 Gödel Prize). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Timothy Avelin Roughgarden
Born(1975-07-20)July 20, 1975
Alma mater
AwardsGödel prize (2012), Social Choice and Welfare Prize (2014)
Scientific career
FieldsComputer Science, Game Theory
InstitutionsColumbia University
ThesisSelfish routing (2002)
Doctoral advisorÉva Tardos
Websitehttp://timroughgarden.org/

Timothy Avelin Roughgarden is a professor of Computer Science at Columbia University.[1] Roughgarden's work deals primarily with game theoretic questions in computer science.

Roughgarden received his Ph.D. at Cornell University in 2002, under the supervision of Éva Tardos.[2] He earned his postdoc from University of California, Berkeley in 2004. From 2004–2018, Roughgarden taught courses on algorithms and game theory at Stanford University. Roughgarden teaches a four-part algorithms specialization on Coursera.[3]

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,[citation needed] the Grace Murray Hopper Award in 2009,[citation needed] 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.[4] He received a Guggenheim Fellowship in 2017.[5][6]

Roughgarden is a co-editor of the 2016 textbook Algorithmic Game Theory, as well as author of two chapters on the inefficiency of equilibria and routing games.[citation needed]

Selected publications

  • 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. CiteSeerX 10.1.1.147.1081. 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". theory.stanford.edu. Retrieved 6 July 2015.
  2. ^ "Tim Roughgarden's Profile - Stanford Profiles". soe.stanford.edu. Stanford University. Archived from the original on 17 July 2012. Retrieved 6 July 2015.
  3. ^ "Algorithms Specialization". coursera.org. Coursera Inc. Retrieved 17 May 2017.
  4. ^ "The Gödel Prize 2012 - Laudatio". European Association for Theoretical Computer Science. 2012. Retrieved 19 January 2020. {{cite web}}: Cite has empty unknown parameter: |authors= (help)
  5. ^ "Tim Roughgarden: Fellow, Awarded 2017". gf.org. John Simon Guggenheim Memorial Foundation. 2017. Retrieved 19 January 2020. {{cite web}}: Cite has empty unknown parameter: |authors= (help)
  6. ^ Knowles, Hannah (17 April 2017). "Four professors named Guggenheim fellows". The Stanford Daily. Retrieved 19 January 2020.


P ≟ NP 

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=Tim_Roughgarden&oldid=936656897"