BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Nash Equilibrium\, Bekic's Lemma and Bar Recursion - Paulo Oliva -
  Queen Mary\, University of London
DTSTART:20111125T140000Z
DTEND:20111125T150000Z
UID:TALK34493@talks.cam.ac.uk
CONTACT:Bjarki Holm
DESCRIPTION:In this talk I will discuss three apparently unrelated topics:
  (1) The construction of backward induction\, which computes Nash equilibr
 ium strategies in n-players sequential games\, (2) the proof of Bekic's le
 mma which says that the Cartesian product of n spaces which have a fixed p
 oint operator will also have a fixed point operator\, and (3) the computat
 ional interpretation of analytical principles such as countable choice via
  Spector's bar recursion. The aim of the talk is to show how these three r
 esults rely on exactly the same construction\, which we have identified as
  the iterated product of selection functions. This is based on recent join
 t work with Martín Escardó.
LOCATION:Room FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR