Explicit Strategies and Quantification for ATL with Incomplete Information and Probabilistic Games

We introduce QAPI (quantified ATL with probabilism and incomplete information), an extension of ATL that provides a flexible mechanism to reason about strategies that can be identified and followed by agents that do not have complete information about the state of the system. QAPI allows reasoning about strategies directly in the object language, which allows to express complex strategic properties as equilibria. We show how several other logics can be expressed in QAPI, and provide suitable bisimulation relations, as well as complexity and decidability results for the model checking problem.