Tim Roughgarden

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.

Timothy Avelin Roughgarden
Roughgarden in 2022
Born	(1975-07-20) July 20, 1975 (age 50)
Alma mater	Stanford University Cornell University
Known for	Contributions to Selfish Routing in the context of Computer science
Awards	Grace Murray Hopper Award (2009) Gödel Prize (2012) Social Choice and Welfare Prize (2014) Kalai Prize (2016)
Scientific career
Fields	Computer science, Game theory
Institutions	Columbia University Stanford University
Thesis	Selfish routing (2002)
Doctoral advisor	Éva Tardos
Website	http://timroughgarden.org/

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