Jump to content

Tim Roughgarden: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
m fixing press release citation formatting; failure of visual editor
added citation for 2009 Grace Murray Hopper Award
Line 42: Line 42:
Roughgarden received his Ph.D. at [[Cornell University]] in 2002, under the supervision of [[Éva Tardos]].<ref>{{cite web|title=Tim Roughgarden's Profile - Stanford Profiles |url=http://soe.stanford.edu/research/surreal.htm |website=soe.stanford.edu |publisher=[[Stanford University]] |accessdate=6 July 2015 |url-status=dead |archiveurl=https://archive.is/20120717014255/http://soe.stanford.edu/research/surreal.htm |archivedate=17 July 2012}}</ref> 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]].<ref>{{cite web |title=Algorithms Specialization |url=https://www.coursera.org/specializations/algorithms |website=coursera.org |publisher=[[Coursera|Coursera Inc.]] |accessdate=17 May 2017}}</ref>
Roughgarden received his Ph.D. at [[Cornell University]] in 2002, under the supervision of [[Éva Tardos]].<ref>{{cite web|title=Tim Roughgarden's Profile - Stanford Profiles |url=http://soe.stanford.edu/research/surreal.htm |website=soe.stanford.edu |publisher=[[Stanford University]] |accessdate=6 July 2015 |url-status=dead |archiveurl=https://archive.is/20120717014255/http://soe.stanford.edu/research/surreal.htm |archivedate=17 July 2012}}</ref> 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]].<ref>{{cite web |title=Algorithms Specialization |url=https://www.coursera.org/specializations/algorithms |website=coursera.org |publisher=[[Coursera|Coursera Inc.]] |accessdate=17 May 2017}}</ref>


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,<ref>{{Cite press release|title=White House Announces 2007 Awards for Early Career Scientists and Engineers|date=19 December 2008|publisher=[[Office of Science and Technology Policy]]|location=[[Washington, D.C.]]|url=https://georgewbush-whitehouse.archives.gov/news/releases/2008/12/20081219-10.html|access-date=19 January 2020|website=The George W. Bush White House Archives}}</ref> the [[Grace Murray Hopper Award]] in 2009,{{Citation needed|date=January 2020}} 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.<ref>{{cite web |authors=<!--None; organization blog--> |title=The Gödel Prize 2012 - Laudatio |url=http://eatcs.org/index.php/component/content/article/1-news/1251-the-goedel-prize-2012-laudatio- |publisher=European Association for Theoretical Computer Science |date=2012 |accessdate=19 January 2020}}</ref><ref>{{cite web |authors=<!--None; organization blog post--> |title=ACM Gödel Prize for Seminal Papers in Algorithmic Game Theory |url=http://gametheorysociety.org/acm-godel-prize-for-seminal-papers-in-algorithmic-game-theory/ |publisher=Game Theory Society |date=3 June 2012 |accessdate=19 January 2020}}</ref> He received a [[Guggenheim Fellowship]] in 2017.<ref>{{cite web |authors=<!--None; organization awards the prize--> |title=Tim Roughgarden: Fellow, Awarded 2017 |url=https://www.gf.org/fellows/all-fellows/tim-roughgarden/ |website=gf.org |publisher=[[John Simon Guggenheim Memorial Foundation]] |date=2017 |accessdate=19 January 2020}}</ref><ref>{{cite news |last=Knowles |first=Hannah |title=Four professors named Guggenheim fellows |url=https://www.stanforddaily.com/2017/04/16/four-professors-named-guggenheim-fellows/ |newspaper=[[The Stanford Daily]] |date=17 April 2017 |accessdate=19 January 2020}}</ref>
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,<ref>{{Cite press release |title=White House Announces 2007 Awards for Early Career Scientists and Engineers |date=19 December 2008 |publisher=[[Office of Science and Technology Policy]] |location=[[Washington, D.C.]] |url=https://georgewbush-whitehouse.archives.gov/news/releases/2008/12/20081219-10.html |access-date=19 January 2020 |website=The George W. Bush White House Archives}}</ref> the [[Grace Murray Hopper Award]] in 2009,<ref>{{Cite press release | title=ACM Awards Recognize Computer Science Innovation |date=31 March 2010 |publisher=[[Association for Computing Machinery]] |url=https://cacm.acm.org/careers/82077-acm-awards-recognize-computer-science-innovation/fulltext?mobile=true?mobile=false |access-date=19 January 2020 |website=acm.org}}</ref> 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.<ref>{{cite web |authors=<!--None; organization blog--> |title=The Gödel Prize 2012 - Laudatio |url=http://eatcs.org/index.php/component/content/article/1-news/1251-the-goedel-prize-2012-laudatio- |publisher=European Association for Theoretical Computer Science |date=2012 |accessdate=19 January 2020}}</ref><ref>{{cite web |authors=<!--None; organization blog post--> |title=ACM Gödel Prize for Seminal Papers in Algorithmic Game Theory |url=http://gametheorysociety.org/acm-godel-prize-for-seminal-papers-in-algorithmic-game-theory/ |publisher=Game Theory Society |date=3 June 2012 |accessdate=19 January 2020}}</ref> He received a [[Guggenheim Fellowship]] in 2017.<ref>{{cite web |authors=<!--None; organization awards the prize--> |title=Tim Roughgarden: Fellow, Awarded 2017 |url=https://www.gf.org/fellows/all-fellows/tim-roughgarden/ |website=gf.org |publisher=[[John Simon Guggenheim Memorial Foundation]] |date=2017 |accessdate=19 January 2020}}</ref><ref>{{cite news |last=Knowles |first=Hannah |title=Four professors named Guggenheim fellows |url=https://www.stanforddaily.com/2017/04/16/four-professors-named-guggenheim-fellows/ |newspaper=[[The Stanford Daily]] |date=17 April 2017 |accessdate=19 January 2020}}</ref>


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|date=January 2020}}
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|date=January 2020}}

Revision as of 05:28, 20 January 2020

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

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. ^ "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. 19 December 2008. Retrieved 19 January 2020.
  5. ^ "ACM Awards Recognize Computer Science Innovation". acm.org (Press release). Association for Computing Machinery. 31 March 2010. Retrieved 19 January 2020.
  6. ^ "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)
  7. ^ "ACM Gödel Prize for Seminal Papers in Algorithmic Game Theory". Game Theory Society. 3 June 2012. Retrieved 19 January 2020. {{cite web}}: Cite has empty unknown parameter: |authors= (help)
  8. ^ "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)
  9. ^ 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=936657727"