Selected Talks by Tim Roughgarden

For A General Audience

• How Computer Science Informs Modern Auction Design, Simons Foundation Public Lecture (2018). Slides
• Game Theory Through the Computational Lens, London School of Economics Public Lecture (2017). Slides
• Equilibria, Computation, and Compromises, Lens of Computation on the Sciences, Institute for Advanced Studies (2014). Slides
• Quantifying the Inefficiency of Game-Theoretic Equilibria, College de France (2012). Slides (En Francais)

Primary Audience = Computer Scientists (Survey Talks)

• Learning Near-Optimal Auctions: Statistical, Computational, and Strategic Challenges, WINE keynote (2017). Slides
• Application-Specific Algorithm Selection, Simons Institute Open Lecture (2016). Slides
• Outposts Between Average- and Worst-Case Analysis: A Case Study in Auction Design, Simons Institute Workshop on Uncertainty in Computation (2016). Slides
• Beyond Worst-Case Analysis, Part 1 and Part 2, Algorithms and Uncertainty Boot Camp, Simons Institute (2016). Slides
• Near-Optimal Equilibria, Part 1 and Part 2, Economics and Computation Boot Camp, Simons Institute (2015). Slides
• Applications of Learning Theory in Algorithmic Game Theory, COLT 2015. Slides
• Intractability in Algorithmic Game Theory, Institute for Advanced Studies (2013). Slides
• How To Think About Algorithmic Mechanism Design, tutorial at FOCS 2010. Slides.

Primary Audience = Computer Scientists (Research Talks)

• How Hard Is Inference for Structured Prediction?, Simons Institute Workshop on Learning, Algorithm Design and Beyond Worst-Case Analysis (2016). Covers my ICML '15 paper (with Globerson, Sontag, and Yildirum). Slides
• Distribution-Free Models of Social and Information Networks, Simons Institute Workshop on Optimization and Decision-Making Under Uncertainty (2016). Covers my ITCS '14 paper (with Gupta and Seshadhri) and follow-up work. Slides
• Complexity Theory and Algorithmic Game Theory: Some New Connections , TCS+ seminar (2015). Covers my FOCS '14 paper and EC '15 papers with Talgam-Cohen and Gopalan/Nisan. Slides
• The Pseudo-Dimension of Near-Optimal Auctions, Simons Institute Workshop on Complexity and Simplicity in Economics (2015). Based on my NIPS '15 paper with Morgenstern. Slides
• Extension Theorems for the Price of Anarchy, Texas A & M Fish Bowl Seminar Series (2013). About my STOC '09 and EC '12 papers on the topic. Slides

Primary Audience = Game Theorists and Economists

• When Are Equilibria of Simple Auctions Near-Optimal?: Part 1 (Positive results) and Part 2 (Negative results), 28th Jerusalem School in Economic Theory (2017). Slides
• On a Theorem of Kalai and Samet: When Do Pure Equilibria Imply a Potential Function? (slides only), Kalai Birthday Workshop (2017).
• Intrinsic Robustness of the Price of Anarchy (slides only), Kalai Prize Lecture (2016).
• Quantifying Inefficiency in Games and Mechanisms (slides only), Social Choice and Welfare Prize Lecture (2014).
• Approximately Optimal Mechanism Design: Motivations, Examples, and Lessons Learned (slides only), talk at EC 2014. Accompanying paper.
• Potentials and Approximation (slides only), Shapley Lecture, Third World Congress of the Game Theory Society (2008).

Home