BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Stochastic games and strategy complexity - Mahsa Shirmohammadi\, U
 niversity of Oxford
DTSTART:20230310T140000Z
DTEND:20230310T150000Z
UID:TALK197890@talks.cam.ac.uk
CONTACT:Jamie Vicary
DESCRIPTION:This talk is about winning strategies in Markov decision proce
 sses and\nstochastic games and is aimed at a general computer science audi
 ence.\nWe start by recalling some of the basic notions in game theory\, su
 ch\nas values\, strategies\, and the memory requirements of optimal and\n
 ε-optimal strategies. We will describe a set of recent advances on\nstrat
 egy complexity of verification-centered objectives\, such as\nsubclasses o
 f parity objectives\, in terms of parameters such as the\ncardinality of t
 he state space\, branching factor of the transition\nfunction\, and whethe
 r the game is concurrent or turn-based.
LOCATION:FW11\, Computer Laboratory
END:VEVENT
END:VCALENDAR