Stochastic games and strategy complexity

Add to your list(s) Download to your calendar using vCal

• Mahsa Shirmohammadi, University of Oxford
• Friday 10 March 2023, 14:00-15:00
• FW11, Computer Laboratory.

If you have a question about this talk, please contact Jamie Vicary.

This talk is about winning strategies in Markov decision processes and stochastic games and is aimed at a general computer science audience. We start by recalling some of the basic notions in game theory, such as values, strategies, and the memory requirements of optimal and ε-optimal strategies. We will describe a set of recent advances on strategy complexity of verification-centered objectives, such as subclasses of parity objectives, in terms of parameters such as the cardinality of the state space, branching factor of the transition function, and whether the game is concurrent or turn-based.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computing and Mathematics
• Department of Computer Science and Technology talks and seminars
• FW11, Computer Laboratory
• Interested Talks
• Logic and Semantics Seminar (Computer Laboratory)
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.