Continuous-Time Stochastic Games with Time-Bounded Reachability

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRÁZDIL Tomáš FOREJT Vojtěch KRČÁL Jan KŘETÍNSKÝ Jan KUČERA Antonín

Year of publication 2009
Type Article in Proceedings
Conference IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords continuous time games; reachability
Description We study continuous-time stochastic games with time-bounded reachability objectives. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Finally, we show how to compute optimal strategies in finite uniform games, and how to compute e-optimal strategies in finitely-branching games with bounded rates (for finite games, we provide detailed complexity estimations).
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.