University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Stochastic games and strategy complexity

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Stochastic games and strategy complexity

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

SBR Graduate Talks Type the title of a new list here BAS Seminar Room 2 and Zoom

Other talks

Laser tomography for wide area gas emission spatio-temporal reconstruction Good and Evil Plasma Cells: Guardians & Saboteurs of Immunity Sera Markoff Inaugural Lecture for the Plumian Professorship in Astronomy and Experimental Philosophy - 'Staring into the heart of darkness: from theory to the direct imaging of black holes' Topology of the Ritz energy landscape Zooming in on the assembly of galaxies in the early Universe Precision psychiatry
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity