View the email archive for
the theory mailing list
590z this quarter will focus on a series of recent results
characterizing the problem of finding Nash equilibria as complete for the
complexity class PPAD, a class of search problems within NP,
suggesting that even solving the
problem with 2 players is intractible, a result that was surprising to many
people working in the field.
This will be interspersed with talks by external speakers presenting
current research on other topics.