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. Information and Computation. Elsevier, 2013, vol. 224, No 1, p. 46-70. ISSN 0890-5401. Available from: https://dx.doi.org/10.1016/j.ic.2013.01.001.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Continuous-Time Stochastic Games with Time-Bounded Reachability
Authors BRÁZDIL, Tomáš (203 Czech Republic, belonging to the institution), Vojtěch FOREJT (203 Czech Republic, belonging to the institution), Jan KRČÁL (203 Czech Republic, belonging to the institution), Jan KŘETÍNSKÝ (203 Czech Republic, guarantor, belonging to the institution) and Antonín KUČERA (203 Czech Republic, belonging to the institution).
Edition Information and Computation, Elsevier, 2013, 0890-5401.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Netherlands
Confidentiality degree is not subject to a state or trade secret
Impact factor Impact factor: 0.604
RIV identification code RIV/00216224:14330/13:00065989
Organization unit Faculty of Informatics
Doi http://dx.doi.org/10.1016/j.ic.2013.01.001
UT WoS 000315361200003
Keywords in English continuous time stochastic systems; time-bounded reachability; stochastic games
Tags formela-journal
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 24/4/2014 17:43.
Abstract
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 rates where 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.
Links
GAP202/10/1469, research and development projectName: Formální metody pro analýzu a verifikaci komplexních systémů
Investor: Czech Science Foundation
MUNI/A/0760/2012, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace II. (Acronym: FI MAV II.)
Investor: Masaryk University, Category A
PrintDisplayed: 5/9/2024 01:23