Tim Roughgarden
American computer scientist
- Stanford University
- Cornell University
- Grace Murray Hopper Award(2009)
- Gödel prize (2012)
- Social Choice and Welfare Prize (2014)
- Kalai Prize(2016)
- Columbia University
- Stanford University
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
- 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
- ^ "Tim Roughgarden's Homepage". theory.stanford.edu. Retrieved July 6, 2015.
- ^ "Tim Roughgarden's Profile - Stanford Profiles". soe.stanford.edu. Stanford University. Archived from the original on July 17, 2012. Retrieved July 6, 2015.
- ^ "Algorithms Specialization". coursera.org. Coursera Inc. Retrieved May 17, 2017.
- ^ "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.
- ^ "ACM Awards Recognize Computer Science Innovation". acm.org (Press release). Association for Computing Machinery. March 31, 2010. Retrieved January 19, 2020.
- ^ "The Gödel Prize 2012 - Laudatio". European Association for Theoretical Computer Science. 2012. Retrieved January 19, 2020.
- ^ "ACM Gödel Prize for Seminal Papers in Algorithmic Game Theory". Game Theory Society. June 3, 2012. Retrieved January 19, 2020.
- ^ "Tim Roughgarden: Fellow, Awarded 2017". gf.org. John Simon Guggenheim Memorial Foundation. 2017. Retrieved January 19, 2020.
- ^ Knowles, Hannah (April 17, 2017). "Four professors named Guggenheim fellows". The Stanford Daily. Retrieved January 19, 2020.
- ^ 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) - ^ "Tim Roughgarden's Books and Surveys". timroughgarden.org. Retrieved April 7, 2021.
External links
- Mathematics Genealogy Project
- Roughgarden's textbook: Algorithmic Game Theory
- v
- t
- e
Grace Murray Hopper Award recipients
- Stallman (1990)
- Hsu (1991)
- Stroustrup (1993)
- Goldwasser (1996)
- Hwu (1999)
- Gollakota (2020)
- Popa (2021)
- Alizadeh (2022)
Authority control databases  | |
|---|---|
| International |
|
| National |
|
| Academics |
|
| Other |
|
| P ≟ NP | This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e
