A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Optimal strategies in concurrent reachability games
[article]
2021
arXiv
pre-print
We study two-player reachability games on finite graphs. At each state the interaction between the players is concurrent and there is a stochastic Nature. Players also play stochastically. The literature tells us that 1) Player B, who wants to avoid the target state, has a positional strategy that maximizes the probability to win (uniformly from every state) and 2) from every state, for every ϵ > 0, Player A has a strategy that maximizes up to ϵ the probability to win. Our work is two-fold.
arXiv:2110.14724v1
fatcat:4ijdp4dfajfadk4w4sfdke7ozq