Theory Day Speaker 2 - Computational Aspects of Equilibria

Other Talks
Saturday, October 24, 2009 - 1:50pm for 3 hours
LeCraw Auditorium
Mihalis Yannakakis – Computer Science, Columbia University
Robin Thomas
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; price equilibria in markets; optimal strategies and the values of competitive games (stochastic and other games); stable configurations of neural networks; analysis of the evolution of various types of dynamic stochastic models. It is not known whether these problems can be solved in polynomial time. Despite their broad diversity, there are certain common computational principles that underlie different types of equilibria and connect many of these problems to each other. In this talk we will discuss some of these common principles and the corresponding complexity classes that capture them; the effect on the complexity of the underlying computational framework; and the relationship with other open questions in computation.