Reachability for Branching Concurrent Stochastic Games

06/11/2018

∙

by   Kousha Etessami, et al.

∙

0

∙

share

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.