Algorithmic analysis demonstrates decidability for reachability and Büchi pure strategies in imperfect information stochastic games, indicating key computational boundaries for multi-agent systems.
We consider imperfect information stochastic games where we require the players to use pure ( i.e. non randomised) strategies. We consider reachability, safety, Büchi and co-Büchi objectives, and investigate the existence of almost-sure/positively winning strategies for the first player when the second player is perfectly informed or more informed than the first player. We obtain decidability results for positive reachability and almost-sure Büchi with optimal algorithms to decide existence of a pure winning strategy and to compute one if it exists. We complete the picture by showing that positive safety is undecidable when restricting to pure strategies even if the second player is perfectly informed.
No takes yet. Share an insight, caveat, or question.
Carayol et al. (2018) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: