Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides
Nathalie Bertrand, Blaise Genest, Hugo Gimbert (LaBRI)

TL;DR
This paper establishes new results on the determinacy and decidability of two-player stochastic reachability games where both players have partial observations, with implications for systems with limited information.
Contribution
It provides the first proofs of determinacy and decidability for such games with partial observation on both sides and finite states.
Findings
Proves determinacy of the game under specified conditions.
Shows decidability of the reachability problem.
Applies to systems with partial information and finite states.
Abstract
We prove two determinacy and decidability results about two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Auction Theory and Applications · Vehicle Routing Optimization Methods
