We give polynomial time algorithms for deciding almost-sure and limit-sure reachability in Branching Concurrent Stochastic Games (BCSGs). These are a class of infinite-state imperfect-information stochastic games that generalize both finite-state concurrent stochastic reachability games, as well as branching simple stochastic reachability games.
@article{arxiv.1806.03907,
title = {Reachability for Branching Concurrent Stochastic Games},
author = {Kousha Etessami and Emanuel Martinov and Alistair Stewart and Mihalis Yannakakis},
journal= {arXiv preprint arXiv:1806.03907},
year = {2019}
}