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:Stochastic games and strategy complexity - Mahsa S
 hirmohammadi\, University of Oxford
DTSTART;TZID=Europe/London:20230310T140000
DTEND;TZID=Europe/London:20230310T150000
UID:TALK197890AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/197890
DESCRIPTION:This talk is about winning strategies in Markov de
 cision processes and\nstochastic games and is aime
 d at a general computer science audience.\nWe star
 t by recalling some of the basic notions in game t
 heory\, such\nas values\, strategies\, and the mem
 ory requirements of optimal and\nε-optimal strateg
 ies. We will describe a set of recent advances on\
 nstrategy complexity of verification-centered obje
 ctives\, such as\nsubclasses of parity objectives\
 , in terms of parameters such as the\ncardinality 
 of the state space\, branching factor of the trans
 ition\nfunction\, and whether the game is concurre
 nt or turn-based.
LOCATION:FW11\, Computer Laboratory
CONTACT:Jamie Vicary
END:VEVENT
END:VCALENDAR