Jump to content

Tim Roughgarden: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
added citation for 2009 Grace Murray Hopper Award
 
(30 intermediate revisions by 23 users not shown)
Line 1: Line 1:
{{Primary sources|date=January 2020}}{{Infobox scientist
{{Short description|American computer scientist}}
{{Use mdy dates|date=March 2024}}
⚫
| name = Timothy Avelin Roughgarden
{{Infobox scientist
| image =
⚫
| name = Timothy Avelin Roughgarden
| caption =
| image = Tim Roughgarden 2022.jpg
⚫
| birth_date = {{birth date |1975|07|20}}
| caption = Roughgarden in 2022
| birth_place =
⚫
| birth_date = {{birth date and age|1975|07|20}}
| residence =
⚫
| fields = [[Computer Science]], [[Game Theory]]
| citizenship =
| workplaces = {{plainlist|
| nationality =
* [[Columbia University]]
⚫
| fields = [[Computer Science]], [[Game Theory]]
| workplaces = [[Columbia University]]
* [[Stanford University]]
}}
| patrons =
| education = <!--Fill in when more information is available-->
| education = <!--Fill in when more information is available-->
| alma_mater = {{plainlist|
| alma_mater = {{plainlist|
* [[Stanford University]]
* [[Stanford University]]
* [[Cornell University]]
* [[Cornell University]]
}}
}}
| thesis_title = Selfish routing
| thesis_title = Selfish routing
| thesis_url = http://theory.stanford.edu/~tim/papers/thesis.pdf
| thesis_url = http://theory.stanford.edu/~tim/papers/thesis.pdf
| thesis_year = 2002
| thesis_year = 2002
| doctoral_advisor = [[Éva Tardos]]
| doctoral_advisor = [[Éva Tardos]]
| academic_advisors =
| academic_advisors =
| doctoral_students =
| doctoral_students =
| notable_students =
| notable_students =
| known_for = Contributions to [[Price of anarchy#Selfish Routing|Selfish Routing]] in the context of [[Computer Science]]
| known_for =
| influences =
| influences =
| influenced =
| influenced =
| awards = [[Gödel prize]] (2012), [[Social Choice and Welfare Prize]] (2014)
| awards = {{plainlist|
* [[Grace Murray Hopper Award]] (2009)
| author_abbrev_bot =
* [[Gödel prize]] (2012)
| author_abbrev_zoo =
* Social Choice and Welfare Prize (2014)
| spouse = <!--(or | spouses = )-->
* [[Kalai Prize]] (2016)
| partner = <!--(or | partners = )-->
}}
| children =
⚫
| website = http://timroughgarden.org/
| signature = <!--(filename only)-->
| signature_alt =
| footnotes =
⚫
| website = http://timroughgarden.org/
| footnotes =
}}
}}


'''Timothy Avelin Roughgarden''' is a professor of Computer Science at [[Columbia University]].<ref>{{cite web |title=Tim Roughgarden's Homepage |url=http://theory.stanford.edu/~tim/ |website=theory.stanford.edu |accessdate=6 July 2015}}</ref> Roughgarden's work deals primarily with [[Game theory|game theoretic]] questions in [[computer science]].
'''Timothy Avelin Roughgarden''' (born July 20, 1975) is an American computer scientist and a professor of Computer Science at [[Columbia University]].<ref>{{cite web |title=Tim Roughgarden's Homepage |url=http://theory.stanford.edu/~tim/ |website=theory.stanford.edu |access-date=6 July 2015}}</ref> Roughgarden's work deals primarily with [[Game theory|game theoretic]] questions in [[computer science]].


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. from [[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]] |access-date=6 July 2015 |url-status=dead |archive-url=https://archive.today/20120717014255/http://soe.stanford.edu/research/surreal.htm |archive-date=17 July 2012}}</ref> He did a postdoc at [[University of California, Berkeley]] in 2004. From 2004 to 2018, Roughgarden was a professor at the Computer Science department at [[Stanford University]] working on algorithms and game theory. 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.]] |access-date=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,<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>
He received the [[Symposium on Theory of Computing#Awards|Danny Lewin award]] at [[Symposium on Theory of Computing|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 |author=<!--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 |access-date=19 January 2020}}</ref><ref>{{cite web |author=<!--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 |access-date=19 January 2020}}</ref> He received a [[Guggenheim Fellowship]] in 2017<ref>{{cite web |author=<!--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 |access-date=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 |access-date=19 January 2020}}</ref> and the [[Kalai Prize]] in 2016.


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 the author of two chapters (''Introduction to the Inefficiency of Equilibria'' and ''Routing Games)''.<ref>{{Cite book|last=Hrsg.|first=Nisan, Noam|url=http://worldcat.org/oclc/870638977|title=Algorithmic game theory|date=24 September 2007|publisher=Cambridge University Press |isbn=978-0-521-87282-9|oclc=870638977}}</ref><ref>{{Cite web|title=Tim Roughgarden's Books and Surveys|url=http://timroughgarden.org/books.html|access-date=2021-04-07|website=timroughgarden.org}}</ref>


==Selected publications==
==Selected publications==
Line 61: Line 59:
* {{cite journal
* {{cite journal
| last1= Roughgarden | first1= Tim
| last1= Roughgarden | first1= Tim
| last2= Tardos | first2 = Éva | authorlink2= Éva Tardos
| last2= Tardos | first2 = Éva | author-link2= Éva Tardos
| title= How Bad is Selfish Routing?
| title= How Bad is Selfish Routing?
| journal= Journal of the ACM
| journal= Journal of the ACM
Line 68: Line 66:
| pages= 236–259 | doi=10.1145/506147.506153
| pages= 236–259 | doi=10.1145/506147.506153
| citeseerx = 10.1.1.147.1081
| citeseerx = 10.1.1.147.1081
| s2cid= 207638789
}}
}}
* {{citation
* {{citation
Line 91: Line 90:
{{DEFAULTSORT:Roughgarden, Tim}}
{{DEFAULTSORT:Roughgarden, Tim}}
[[Category:Living people]]
[[Category:Living people]]
[[Category:Theoretical computer scientists]]
[[Category:American theoretical computer scientists]]
[[Category:Columbia University faculty]]
[[Category:Stanford University faculty]]
[[Category:Stanford University faculty]]
[[Category:Gödel Prize laureates]]
[[Category:Gödel Prize laureates]]
[[Category:1975 births]]
[[Category:1975 births]]
[[Category:2023 fellows of the Association for Computing Machinery]]
[[Category:Recipients of the Presidential Early Career Award for Scientists and Engineers]]




Latest revision as of 07:41, 13 September 2024

Timothy Avelin Roughgarden
Roughgarden in 2022
Born (1975-07-20) July 20, 1975 (age 49)
Alma mater
Known forContributions to Selfish Routing in the context of Computer 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 at Columbia University.[1] Roughgarden's work deals primarily with game theoretic questions in computer science.

Roughgarden received his Ph.D. from Cornell University in 2002, under the supervision of Éva Tardos.[2] He did a postdoc at University of California, Berkeley in 2004. From 2004 to 2018, Roughgarden was a professor at the Computer Science department at Stanford University working on algorithms and game theory. 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] and the Kalai Prize in 2016.

Roughgarden is a co-editor of the 2016 textbook Algorithmic Game Theory, as well as the author of two chapters (Introduction to the Inefficiency of Equilibria and Routing 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. CiteSeerX 10.1.1.147.1081. doi:10.1145/506147.506153. S2CID 207638789.
  • 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. Retrieved July 6, 2015.
  2. ^ "Tim Roughgarden's Profile - Stanford Profiles". soe.stanford.edu. Stanford University. Archived from the original on July 17, 2012. Retrieved July 6, 2015.
  3. ^ "Algorithms Specialization". coursera.org. Coursera Inc. Retrieved May 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. Retrieved January 19, 2020.
  5. ^ "ACM Awards Recognize Computer Science Innovation". acm.org (Press release). Association for Computing Machinery. March 31, 2010. Retrieved January 19, 2020.
  6. ^ "The Gödel Prize 2012 - Laudatio". European Association for Theoretical Computer Science. 2012. Retrieved January 19, 2020.
  7. ^ "ACM Gödel Prize for Seminal Papers in Algorithmic Game Theory". Game Theory Society. June 3, 2012. Retrieved January 19, 2020.
  8. ^ "Tim Roughgarden: Fellow, Awarded 2017". gf.org. John Simon Guggenheim Memorial Foundation. 2017. Retrieved January 19, 2020.
  9. ^ Knowles, Hannah (April 17, 2017). "Four professors named Guggenheim fellows". The Stanford Daily. Retrieved January 19, 2020.
  10. ^ Hrsg., Nisan, Noam (September 24, 2007). Algorithmic game theory. Cambridge University Press. ISBN 978-0-521-87282-9. OCLC 870638977.{{cite book}}: CS1 maint: multiple names: authors list (link)
  11. ^ "Tim Roughgarden's Books and Surveys". timroughgarden.org. Retrieved April 7, 2021.
[edit]


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=1245484939"