This seminar meets Tuesdays, 1:30pm-2:20pm in EE1 045.
To join the e-mail list for the seminar and to find out about other
items of interest in theoretical computer science,
students should
sign up for the theory-students mailing list.
View the email archive for
theory-group
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.