Determinacy and Optimal Strategies in Infinite-state Stochastic Reachability Games
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00080195" target="_blank" >RIV/00216224:14330/13:00080195 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S030439751200967X" target="_blank" >http://www.sciencedirect.com/science/article/pii/S030439751200967X</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2012.10.038" target="_blank" >10.1016/j.tcs.2012.10.038</a>
Alternative languages
Result language
angličtina
Original language name
Determinacy and Optimal Strategies in Infinite-state Stochastic Reachability Games
Original language description
We consider perfect-information reachability stochastic games for 2 players on countable graphs. Such a game is strongly determined if, whenever we fix an inequality ~E{>,>=} and a threshold p, either Player Max has a strategy which forces the value of the game to satisfy ~p against any strategy of Player Min, or Min has a strategy which forces the opposite against any strategy of Max. One of our results shows that whenever one of the players has an optimal strategy in every state of a game, thenthis game is strongly determined. This significantly generalises, e.g., recent results on finitely-branching reachability games. For strong determinacy, our methods are substantially different, based on which player has the optimal strategy, because theroles of the players are not symmetric. We also do not restrict the branching of the games, and where we provide an extension of results for finitely-branching games, we had to overcome significant complications and employ new methods as
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
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
Name of the periodical
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
493
Issue of the periodical within the volume
1
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
18
Pages from-to
80-97
UT code for WoS article
000321410000007
EID of the result in the Scopus database
—