"Game and Market Equilibria: Approximation and Smoothed Complexity"

Shang-Hua Teng, Boston University

I will present some recent advances in Computational Game Theory and particularly in computing and approximating Nash equilibria...As the complexity and scale of typical internet applications increase, the problem of efficiently analyzing their game-theoretic properties become more pointed.

I will cover the recent results in settling several open questions about Nash equilibria.