BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The Complexity of the Homotopy Method\, Equilibrium Selection\, an
 d Lemke-Howson Solutions - Rahul Savani\, University of Liverpool
DTSTART:20110414T130000Z
DTEND:20110414T140000Z
UID:TALK30829@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:We show that the widely used homotopy method for solving fixpo
 int problems\, as well as the Harsanyi-Selten equilibrium selection proces
 s\nfor games\, are PSPACE-complete to implement. A key application of our 
 techniques yields the result that it is also PSPACE-complete to\ncompute a
 ny of the equilibria that could be found via the classical Lemke-Howson al
 gorithm.\n\nJoint work with Paul W. Goldberg and Christos H. Papadimitriou
 .
LOCATION:Small lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR