mlsanityData to 14 Oct 2026

Probabilistic Strategy Logic with Degrees of Observability

arXiv 2412.15135 ↗First posted 19 Dec 2024cs.AI cs.LOcited by 0

Not on the map. Why?

Abstract (arXiv)

There has been considerable work on reasoning about the strategic ability of agents under imperfect information. However, existing logics such as Probabilistic Strategy Logic are unable to express properties relating to information transparency. Information transparency concerns the extent to which agents' actions and behaviours are observable by other agents. Reasoning about information transparency is useful in many domains including security, privacy, and decision-making. In this paper, we present a formal framework for reasoning about information transparency properties in stochastic multi-agent systems. We extend Probabilistic Strategy Logic with new observability operators that capture the degree of observability of temporal properties by agents. We show that the model checking problem for the resulting logic is decidable.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 26 references that are in the map. First posted on arXiv 19 Dec 2024.

Builds on

5 of 26 references.

References · 5

  1. 2018Equilibria-based Probabilistic Model Checking for Concurrent Stochastic Gamescited by 8
  2. 2023AutoHyper: Explicit-State Model Checking for HyperLTLcited by 8
  3. 2018Strategy Logic with Imperfect Informationcited by 6
  4. 2014Algorithms in Real Algebraic Geometry: A Surveycited by 5
  5. 2021Towards the Verification of Strategic Properties in Multi-Agent Systems with Imperfect Informationcited by 2

Built on by

Not cited yet.