Tim Roughgarden
Use attributes for filter ! | |
Gender | Male |
---|---|
Age | 49 |
Date of birth | July 20,1975 |
Zodiac sign | Cancer |
Thesis | Selfish routing |
Education | University of California, Berkeley |
Stanford University | |
Cornell University | |
Books | Algorithms Illuminated (Part 1): The Basics |
Communication Complexity (for Algorithm Designers) | |
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | |
Selfish Routing and the Price of Anarchy | |
Algorithmic Game Theory | |
Algorithms Illuminated: Algorithms for NP-hard problems | |
Twenty Lectures on Algorithmic Game Theory | |
Communication Complexity (2016) | |
Awards | Gödel Prize |
Social Choice and Welfare Prize | |
Gödel prize ; Social Choice and Welfare Prize (2014) | |
Guggenheim Fellowship for Natural Sciences, US & Canada | |
Grace Murray Hopper Award | |
Official site | timroughgarden.org |
Affiliations | Columbia University |
Doctor advisor | Éva Tardos |
Interests | Algorithms |
Game Theory | |
Networks | |
H index | 67 |
Academic advisor | Éva Tardos |
Publications | scholar.google.com |
Date of Reg. | |
Date of Upd. | |
ID | 1073279 |
Tim Roughgarden Life story
Timothy Avelin Roughgarden is an American computer scientist and 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. from Cornell University in 2002, under the supervision of Éva Tardos.