LIPIcs.FSTTCS.2009.2307.pdf
- Filesize: 215 kB
- 12 pages
Document
Continuous-Time Stochastic Games with Time-Bounded Reachability
Authors
-
Part of:
Volume:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2009-12-14
Cite AsGet BibTex
Tomas Brazdil, Vojtech Forejt, Jan Krcal, Jan Kretinsky, and Antonin Kucera. Continuous-Time Stochastic Games with Time-Bounded Reachability. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 61-72, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2307
https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2307
Abstract
We study continuous-time stochastic games with time-bounded
reachability objectives. We show that each vertex in such a game
has a \emph{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 $\varepsilon$-optimal strategies in
finitely-branching games with bounded rates (for finite games, we
provide detailed complexity estimations).
Keywords
- Continuous time stochastic systems
- time bounded reachability
- stochastic games
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads