  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.
