Continuous-Time Stochastic Games with Time-Bounded Reachability

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00065989" target="_blank" >RIV/00216224:14330/13:00065989 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ic.2013.01.001" target="_blank" >http://dx.doi.org/10.1016/j.ic.2013.01.001</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ic.2013.01.001" target="_blank" >10.1016/j.ic.2013.01.001</a>

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 and time-abstract strategies. 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. Further, we show how to compute epsilon-optimal strategies in finite games and provide detailed complexity estimations. Moreover, we show how to compute epsilon-optimal strategies in infinite games with finite branching and bounded rateswhere the bound as well as the successors of a given state are effectively computable. Finally, we show how to compute optimal strategies in finite uniform games.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GAP202%2F10%2F1469" target="_blank" >GAP202/10/1469: Formal methods for analysis and verification of complex systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)