Tim Roughgarden

Timothy Avelin Roughgarden is a professor of Computer Science at Columbia University. 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. 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.

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, the Grace Murray Hopper Award in 2009, 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. He received a Guggenheim Fellowship in 2017.

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.

• 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