Continuous-Time Stochastic Games with Time-Bounded Reachability
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F09%3A00038704" target="_blank" >RIV/00216224:14330/09:00038704 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Continuous-Time Stochastic Games with Time-Bounded Reachability
Original language 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, weshow 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).
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)
ISBN
978-3-939897-13-2
ISSN
1868-8969
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Place of publication
Dagstuhl, Germany
Event location
IIT Kanpur, India
Event date
Dec 15, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—