when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-23077
URL:

; ; ; ;

### Continuous-Time Stochastic Games with Time-Bounded Reachability

 pdf-format:

### 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).

### BibTeX - Entry

@InProceedings{brazdil_et_al:LIPIcs:2009:2307,
author =	{Tomas Brazdil and Vojtech Forejt and Jan Krcal and Jan Kretinsky and Antonin Kucera},
title =	{{Continuous-Time Stochastic Games with Time-Bounded Reachability}},
booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
pages =	{61--72},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-939897-13-2},
ISSN =	{1868-8969},
year =	{2009},
volume =	{4},
editor =	{Ravi Kannan and K. Narayan Kumar},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2307},
URN =		{urn:nbn:de:0030-drops-23077},
doi =		{http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2009.2307},
annote =	{Keywords: Continuous time stochastic systems, time bounded reachability, stochastic games}
}


 Keywords: Continuous time stochastic systems, time bounded reachability, stochastic games Seminar: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science Related Scholarly Article: Issue date: 2009 Date of publication: 2009

DROPS-Home | Fulltext Search | Imprint