Reachability for Branching Concurrent Stochastic Games
classification
💻 cs.GT
keywords
gamesstochasticreachabilitybranchingconcurrentalgorithmsalmost-surebcsgs
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.