Public Lecture: Game Theory Through the Computational Lens
Date: Thursday 30 November 2017
Speaker: Prof Tim Roughgarden
Chair: Martin Anthony
Tim Roughgarden is a Professor in the Computer Science and (by courtesy) Management Science and Engineering Departments, Stanford University, as well as a Visiting Professor in the Department of Mathematics.
The fields of computer science and game theory both trace their roots to the first half of the 20th century, with the work of Turing, von Neumann, Nash, and others. Fast forwarding to the present, there are now many fruitful points of contact between these two fields. Game theory plays an important role in 21st-century computer science applications, ranging from social networks to routing in the Internet. The flow of ideas also travels in the other direction, with computer science offering a number of tools to reason about economic problems in novel ways. For example, computational complexity theory sheds new light on the “bounded rationality” of decision-makers. Approximation guarantees, originally developed to analyse fast heuristic algorithms, can be usefully applied to Nash equilibria. Computationally efficient algorithms are an essential ingredient to modern, large-scale auction designs. In this lecture, Tim Roughgarden will survey the key ideas behind these connections and their implications.
More information on this event is available here, along with a podcast and video recording.