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.