Tim Roughgarden

from Wikipedia, the free encyclopedia

Timothy "Tim" Avelin Roughgarden (born July 20, 1975 ) is an American computer scientist. He is a professor at Stanford University .

Career, research and teaching

Roughgarden studied at Stanford University and Cornell University , where he received his doctorate from Éva Tardos in 2002 (Selfish Routing). He then did a postdoc at the University of California, Berkeley , before returning to Stanford University. There he was promoted to professor.

He deals with algorithmic game theory with application to large networks such as the Internet ( selfish routing ).

He was invited speaker at the 2006 International Congress of Mathematicians in Madrid (Potential Functions and the Inefficiency of Equilibria).

Roughgarden has received several awards for his work. For example, in 2003 he received the AW Tucker Prize. In 2009 he received the Grace Murray Hopper Award , in 2012 the Gödel Prize together with Tardos and others, the Kalai Prize in 2016 and the Frederick W. Lanchester Prize in 2019 .

Fonts

  • Editor with Noam Nisan , Éva Tardos , Vijay Vazirani : Algorithmic Game Theory, Cambridge University Press 2007 (therein Chapter 18: Routing Games)
  • Algorithmic Game Theory, Communications of the ACM, July 2010
  • Selfish Routing and the Price of Anarchy, MIT Press 2005
  • with Eva Tardos: How Bad is Selfish Routing?, Journal of the ACM, Volume 49, 2002, pp. 236-259 (received Gödel Prize)

Web links

Individual evidence

  1. Tim Roughgarden in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ^ Tucker Prize