Reachability for Branching Concurrent Stochastic Games

TL;DR

This paper presents polynomial-time algorithms for determining almost-sure and limit-sure reachability in Branching Concurrent Stochastic Games, a complex class of infinite-state stochastic games with imperfect information.

Contribution

It introduces the first polynomial-time algorithms for reachability problems in BCSGs, generalizing previous results to a broader class of stochastic games.

Findings

Polynomial algorithms for almost-sure reachability

Polynomial algorithms for limit-sure reachability

Generalization of previous stochastic game results

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.