In 1951 Nash showed that every game has a mixed equilibrium; his proof is essentially a reduction to Brouwer's fixpoint theorem.  Whether such an equilibrium can be found efficiently has been open since that time.  This talk surveys some recent results (jointly with Paul Goldberg and Costas Daskalakis) that shed light to this problem, essentially by demonstrating a reduction in the opposite direction.

Wednesday, October 12, 2005

IRCS Large Conference Room 470

3401 Walnut Street

3:00 - 4:00