Biography:Tim Roughgarden
Timothy Avelin Roughgarden | |
|---|---|
 Roughgarden in 2022 | |
| Born | July 20, 1975 |
| Alma mater | |
| Known for | Contributions to Selfish Routing in the context of Computer Science |
| Awards |
|
| Scientific career | |
| Fields | Computer Science, Game Theory |
| Institutions | |
| Thesis | Selfish routing (2002) |
| Doctoral advisor | Éva Tardos |
| Website | http://timroughgarden.org/ |
Timothy Avelin Roughgarden 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 (March 2002). "How Bad is Selfish Routing?". Journal of the ACM 49 (2): 236–259. 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
- ↑ "Tim Roughgarden's Homepage". http://theory.stanford.edu/~tim/.
- ↑ "Tim Roughgarden's Profile - Stanford Profiles". Stanford University. http://soe.stanford.edu/research/surreal.htm.
- ↑ "Algorithms Specialization". Coursera Inc.. https://www.coursera.org/specializations/algorithms.
- ↑ "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.
- ↑ "ACM Awards Recognize Computer Science Innovation". acm.org (Press release). Association for Computing Machinery. 31 March 2010. Retrieved 19 January 2020.
- ↑ "The Gödel Prize 2012 - Laudatio". European Association for Theoretical Computer Science. 2012. http://eatcs.org/index.php/component/content/article/1-news/1251-the-goedel-prize-2012-laudatio-.
- ↑ "ACM Gödel Prize for Seminal Papers in Algorithmic Game Theory". Game Theory Society. 3 June 2012. http://gametheorysociety.org/acm-godel-prize-for-seminal-papers-in-algorithmic-game-theory/.
- ↑ "Tim Roughgarden: Fellow, Awarded 2017". John Simon Guggenheim Memorial Foundation. 2017. https://www.gf.org/fellows/all-fellows/tim-roughgarden/.
- ↑ Knowles, Hannah (17 April 2017). "Four professors named Guggenheim fellows". The Stanford Daily. https://www.stanforddaily.com/2017/04/16/four-professors-named-guggenheim-fellows/.
- ↑ Hrsg., Nisan, Noam (24 September 2007). Algorithmic game theory. ISBN 978-0-521-87282-9. OCLC 870638977. http://worldcat.org/oclc/870638977.
- ↑ "Tim Roughgarden's Books and Surveys". http://timroughgarden.org/books.html.
External links
- Mathematics Genealogy Project
- Roughgarden's textbook: Algorithmic Game Theory
 |  |
