Jump to content

Tim Roughgarden

From Wikipedia, the free encyclopedia

Timothy Avelin Roughgarden
Roughgarden in 2022
Born(1975-07-20)July 20, 1975(age 49)
Alma mater
Known forContributions toSelfish Routingin the context ofComputer Science
Awards
Scientific career
FieldsComputer Science,Game Theory
Institutions
ThesisSelfish routing(2002)
Doctoral advisorÉva Tardos
Websitehttp://timroughgarden.org/

Timothy Avelin Roughgarden(born July 20, 1975) is an American computer scientist and a professor of Computer Science atColumbia University.[1]Roughgarden's work deals primarily withgame theoreticquestions incomputer science.

Roughgarden received his Ph.D. fromCornell Universityin 2002, under the supervision ofÉva Tardos.[2]He did a postdoc atUniversity of California, Berkeleyin 2004. From 2004 to 2018, Roughgarden was a professor at the Computer Science department atStanford Universityworking on algorithms and game theory. Roughgarden teaches a four-part algorithms specialization onCoursera.[3]

He received theDanny Lewin awardatSTOC2002 for the best student paper. He received thePresidential Early Career Award for Scientists and Engineersin 2007,[4]theGrace Murray Hopper Awardin 2009,[5]and theGödel Prizein 2012 for his work on routing traffic in large-scale communication networks to optimize performance of a congested network.[6][7]He received aGuggenheim Fellowshipin 2017[8][9]and theKalai Prizein 2016.

Roughgarden is a co-editor of the 2016 textbookAlgorithmic Game Theory,as well as the author of two chapters (Introduction to the Inefficiency of EquilibriaandRouting Games).[10][11]

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.CiteSeerX10.1.1.147.1081.doi:10.1145/506147.506153.S2CID207638789.
  • 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]
  1. ^"Tim Roughgarden's Homepage".theory.stanford.edu.RetrievedJuly 6,2015.
  2. ^"Tim Roughgarden's Profile - Stanford Profiles".soe.stanford.edu.Stanford University.Archived fromthe originalon July 17, 2012.RetrievedJuly 6,2015.
  3. ^"Algorithms Specialization".coursera.org.Coursera Inc.RetrievedMay 17,2017.
  4. ^"White House Announces 2007 Awards for Early Career Scientists and Engineers".The George W. Bush White House Archives(Press release).Washington, D.C.:Office of Science and Technology Policy.December 19, 2008.RetrievedJanuary 19,2020.
  5. ^"ACM Awards Recognize Computer Science Innovation".acm.org(Press release).Association for Computing Machinery.March 31, 2010.RetrievedJanuary 19,2020.
  6. ^"The Gödel Prize 2012 - Laudatio".European Association for Theoretical Computer Science. 2012.RetrievedJanuary 19,2020.
  7. ^"ACM Gödel Prize for Seminal Papers in Algorithmic Game Theory".Game Theory Society. June 3, 2012.RetrievedJanuary 19,2020.
  8. ^"Tim Roughgarden: Fellow, Awarded 2017".gf.org.John Simon Guggenheim Memorial Foundation.2017.RetrievedJanuary 19,2020.
  9. ^Knowles, Hannah (April 17, 2017)."Four professors named Guggenheim fellows".The Stanford Daily.RetrievedJanuary 19,2020.
  10. ^Hrsg., Nisan, Noam (September 24, 2007).Algorithmic game theory.Cambridge University Press.ISBN978-0-521-87282-9.OCLC870638977.{{cite book}}:CS1 maint: multiple names: authors list (link)
  11. ^"Tim Roughgarden's Books and Surveys".timroughgarden.org.RetrievedApril 7,2021.
[edit]


P ≟ NP

This biographical article relating to acomputer scientistis astub.You can help Wikipedia byexpanding it.

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