Competition: US & Canada
Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University. He received a BS in Applied Mathematics from Stanford in 1997, and a PhD in Computer Science from Cornell in 2002.
His research interests include the many connections between computer science and economics, as well as the design, analysis, applications, and limitations of algorithms. He has written the books “Selfish Routing and the Price of Anarchy” (MIT Press, 2005), “Algorithmic Game Theory” (co-edited with Noam Nisan, Eva Tardos, and Vijay Vazirani, Cambridge, 2007), “Communication Complexity (for Algorithm Designers)” (NOW Publishers, 2016), and “Twenty Lectures on Algorithmic Game Theory” (Cambridge, 2016). For his research, he has been awarded the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Computer Science and Game Theory, the Shapley Lecturership of the Game Theory Society, the Social Choice and Welfare Prize, INFORM’s Optimization Prize for Young Researchers, the Mathematical Programming Society’s Tucker Prize, and the EATCS-SIGACT Gödel Prize.