Detailed Information on Publication Record
2013
Continuous-Time Stochastic Games with Time-Bounded Reachability
BRÁZDIL, Tomáš, Vojtěch FOREJT, Jan KRČÁL, Jan KŘETÍNSKÝ, Antonín KUČERA et. al.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
Language
English
Type of outcome
Článek v odborném periodiku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Netherlands
Confidentiality degree
není předmětem státního či obchodního tajemství
Impact factor
Impact factor: 0.604
RIV identification code
RIV/00216224:14330/13:00065989
Organization unit
Faculty of Informatics
UT WoS
000315361200003
Keywords in English
continuous time stochastic systems; time-bounded reachability; stochastic games
Tags
Tags
International impact, Reviewed
Změněno: 24/4/2014 17:43, RNDr. Pavel Šmerk, Ph.D.
Abstract
V originále
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 project |
| ||
MUNI/A/0760/2012, interní kód MU |
|