2017 - Fellow of John Simon Guggenheim Memorial Foundation
2009 - ACM Grace Murray Hopper Award For his research combining computer science and game theory to analyze network routing among self-interested parties.
2006 - Fellow of Alfred P. Sloan Foundation
Mathematical economics, Nash equilibrium, Mathematical optimization, Price of anarchy and Latency are his primary areas of study. His Mathematical economics study combines topics in areas such as Common value auction and Inefficiency. The various areas that Tim Roughgarden examines in his Nash equilibrium study include Network planning and design, Marginal cost, Game theory and Correlated equilibrium.
His research integrates issues of Function, Optimal mechanism, Scheduling and Probabilistic analysis of algorithms in his study of Mathematical optimization. In Price of anarchy, Tim Roughgarden works on issues like Outcome, which are connected to Hardness of approximation. His work deals with themes such as Network traffic control and Network performance, which intersect with Latency.
His scientific interests lie mostly in Mathematical economics, Mathematical optimization, Common value auction, Theoretical computer science and Nash equilibrium. His biological study spans a wide range of topics, including Computational complexity theory, Incentive and Price of anarchy. His Mathematical optimization research is multidisciplinary, incorporating elements of Network planning and design and Function.
His Common value auction study often links to related topics such as Mechanism design. His Nash equilibrium study incorporates themes from Correlated equilibrium, Shapley value and Latency. His research in Algorithmic game theory is mostly concerned with Algorithmic mechanism design.
Tim Roughgarden spends much of his time researching Mathematical economics, Computational complexity theory, Theoretical computer science, Algorithm and Mathematical optimization. His work in the fields of Fair division overlaps with other areas such as Class. His studies deal with areas such as Game theory, Stochastic game and Algorithmic game theory as well as Computational complexity theory.
His Algorithmic game theory study combines topics from a wide range of disciplines, such as Revenue maximization and Auction theory. The Theoretical computer science study combines topics in areas such as Learnability and Robustness. The concepts of his Mathematical optimization study are interwoven with issues in Optimal mechanism and Rule of thumb.
The scientist’s investigation covers issues in Mathematical economics, Monotone polygon, Submodular set function, Fair division and Algorithm. Specifically, his work in Mathematical economics is concerned with the study of Game theory. There are a combination of areas like Equilibrium point, Binary search algorithm, Optimization problem, Graph and Boolean function integrated together with his Monotone polygon study.
His research in Fair division intersects with topics in Discrete mathematics, Submodular function minimization and Pareto principle. His work carried out in the field of Algorithm brings together such families of science as Function and Maximization. His Class research spans across into areas like Communication complexity, Valuation, Polynomial, Proportionality and Discount points.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
How bad is selfish routing
Tim Roughgarden;Éva Tardos.
Journal of the ACM (2002)
Algorithmic Game Theory: Computing in Games
Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani.
(2007)
Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria
Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani.
(2007)
The Price of Stability for Network Design with Fair Cost Allocation
Elliot Anshelevich;Anirban Dasgupta;Jon Kleinberg;Éva Tardos.
SIAM Journal on Computing (2008)
Selfish Routing and the Price of Anarchy
Tim Roughgarden.
(2005)
Universally Utility-maximizing Privacy Mechanisms
Arpita Ghosh;Tim Roughgarden;Mukund Sundararajan.
SIAM Journal on Computing (2012)
Computing correlated equilibria in multi-player games
Christos H. Papadimitriou;Tim Roughgarden.
Journal of the ACM (2008)
Stackelberg Scheduling Strategies
Tim Roughgarden.
SIAM Journal on Computing (2004)
Bounding the inefficiency of equilibria in nonatomic congestion games
Tim Roughgarden;Éva Tardos.
Games and Economic Behavior (2004)
Simple versus optimal mechanisms
Jason D. Hartline;Tim Roughgarden.
electronic commerce (2009)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Cornell University
Hebrew University of Jerusalem
New York University
New York University
University of California, Santa Cruz
University of California, Irvine
Northwestern University
Sapienza University of Rome
University of Pennsylvania
Carnegie Mellon University
Augusta University
Dublin City University
Rice University
Lancaster University
University of Leeds
University of Arizona
Kyoto University
California Institute of Technology
Aalborg University
National Institute of Technology Tiruchirappalli
Pontifical Catholic University of Rio Grande do Sul
University of Konstanz
Maastricht University
Sorbonne University
Pompeu Fabra University
Arizona State University