| 词条 | Tim Roughgarden |
| 释义 |
| name = Timothy Avelin Roughgarden | image = | caption = | birth_date = {{birth date |1975|07|20}} | birth_place = | residence = | citizenship = | nationality = | fields = Computer Science, Game Theory | workplaces = Stanford University | patrons = | education = | alma_mater = {{plainlist|
}} | thesis_title = Selfish routing | thesis_url = http://theory.stanford.edu/~tim/papers/thesis.pdf | thesis_year = 2002 | doctoral_advisor = Éva Tardos | academic_advisors = | doctoral_students = | notable_students = | known_for = | influences = | influenced = | awards = Gödel prize (2012) | author_abbrev_bot = | author_abbrev_zoo = | spouse = | partner = | children = | signature = | signature_alt = | website = http://theory.stanford.edu/~tim/ | footnotes = }}Timothy Avelin Roughgarden is a professor of Computer Science at Columbia University.[1] Tim received his Ph.D. at Cornell University in 2002, under the supervision of Éva Tardos.[2] Roughgarden teaches a popular four-part algorithms specialization on Coursera.[3] Roughgarden's work is concerned with game theoretic questions in computer science. 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. Selected publications
| last= Roughgarden | first =Tim | title = Twenty Lectures on Algorithmic Game Theory |publisher = Cambridge University Press |year = 2016 }}
| last= Roughgarden | first =Tim | title = Selfish Routing and the Price of Anarchy |publisher = MIT Press |year = 2005 }}
|last1= Roughgarden | first1 = Tim | last2 =Tardos | first2 = Éva | authorlink2= Éva Tardos | title = How Bad is Selfish Routing? |journal = Journal of the ACM |date=March 2002 | volume =49 | issue=2 | pages= 236–259 | doi=10.1145/506147.506153 | citeseerx = 10.1.1.147.1081 }}
| last = Roughgarden | first = Tim | contribution= The price of anarchy is independent of the network topology | title = Proceedings of the 34th Symposium on Theory of Computing | year = 2002 | pages= 428–437 | title-link = Symposium on Theory of Computing }} References1. ^{{cite web|title=Tim Roughgarden's Homepage|url=http://theory.stanford.edu/~tim/|website=http://theory.stanford.edu|accessdate=6 July 2015}} 2. ^{{cite web|title=Tim Roughgarden's Profile - Stanford Profiles|url=http://soe.stanford.edu/research/surreal.htm|website=http://soe.stanford.edu|publisher=Stanford University|accessdate=6 July 2015|deadurl=yes|archiveurl=https://archive.is/20120717014255/http://soe.stanford.edu/research/surreal.htm|archivedate=17 July 2012|df=}} 3. ^{{cite web|title=Algorithms Specialization|url=https://www.coursera.org/specializations/algorithms|website=https://www.coursera.org|publisher=Coursera Inc|accessdate=17 May 2017}} External links
5 : Living people|Theoretical computer scientists|Stanford University faculty|Gödel Prize laureates|1975 births |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。