Other formats:
BibTeX
LaTeX
RIS
@inproceedings{869238,
author = {Brázdil, Tomáš and Forejt, Vojtěch and Krčál, Jan and Křetínský, Jan and Kučera, Antonín},
address = {Dagstuhl, Germany},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)},
keywords = {continuous time games; reachability},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Dagstuhl, Germany},
isbn = {978-3-939897-13-2},
pages = {61-72},
publisher = {Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik},
title = {Continuous-Time Stochastic Games with Time-Bounded Reachability},
year = {2009}
}
TY - JOUR
ID - 869238
AU - Brázdil, Tomáš - Forejt, Vojtěch - Krčál, Jan - Křetínský, Jan - Kučera, Antonín
PY - 2009
TI - Continuous-Time Stochastic Games with Time-Bounded Reachability
PB - Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
CY - Dagstuhl, Germany
SN - 9783939897132
KW - continuous time games
KW - reachability
N2 - 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).
ER -
BRÁZDIL, Tomáš, Vojtěch FOREJT, Jan KRČÁL, Jan KŘETÍNSKÝ and Antonín KUČERA. Continuous-Time Stochastic Games with Time-Bounded Reachability. In \textit{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)}. Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2009, p.~61-72. ISBN~978-3-939897-13-2.
|
