BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Logic and Semantics Seminar (Computer Laboratory)
SUMMARY:Nash Equilibrium\, Bekic's Lemma and Bar Recursion
- Paulo Oliva - Queen Mary\, University of London
DTSTART;TZID=Europe/London:20111125T140000
DTEND;TZID=Europe/London:20111125T150000
UID:TALK34493AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/34493
DESCRIPTION:In this talk I will discuss three apparently unrel
ated topics: (1) The construction of backward indu
ction\, which computes Nash equilibrium strategies
in n-players sequential games\, (2) the proof of
Bekic's lemma which says that the Cartesian produc
t of n spaces which have a fixed point operator wi
ll also have a fixed point operator\, and (3) the
computational interpretation of analytical princip
les such as countable choice via Spector's bar rec
ursion. The aim of the talk is to show how these t
hree results rely on exactly the same construction
\, which we have identified as the iterated produc
t of selection functions. This is based on recent
joint work with MartÃn EscardÃ³.
LOCATION:Room FW11\, Computer Laboratory\, William Gates Bu
ilding
CONTACT:Bjarki Holm
END:VEVENT
END:VCALENDAR