Organiser: Dr Enrico H Gerding
Time: 28/01/2008 13:00-14:00
Nash equilibrium is one of the most important solution concepts in classical game theory. However, till recently the computational complexity of computing a Nash equilibrium in a normal-form game was unknown. In this talk, we will give an overview of the recent progress in this area, covering the seminal PPAD-completeness result by Chen and Deng for 2-player normal-form games, related results for graphical games, as well as hardness results for several special types of Nash equilibria. The talk will be self-contained and assumes no previous knowledge of game theory or computational complexity.
Any member of ECS with their name preceded by a sign has not given their permission for their information to appear on the public website.