Probabilistic Strategy Logic with Degrees of Observability

Publication date

2025-04-11

Authors

Mu, Chunyan
Motamed, NimaORCID 0000-0003-4379-1968ISNI 000000052424607X
Alechina, NatashaORCID 0000-0003-3306-9891ISNI 0000000124421545
Logan, BrianORCID 0000-0003-0648-7107ISNI 0000000124462996

Editors

Walsh, Toby
Shah, Julie
Kolter, Zico

Advisors

Supervisors

Document Type

Part of book
Open Access logo

License

taverne

Abstract

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.

Keywords

Taverne, Artificial Intelligence

Citation

Mu, C, Motamed, N, Alechina, N & Logan, B 2025, Probabilistic Strategy Logic with Degrees of Observability. in T Walsh, J Shah & Z Kolter (eds), Special Track on AI Alignment. Proceedings of the AAAI Conference on Artificial Intelligence, no. 14, vol. 39, Association for the Advancement of Artificial Intelligence, pp. 15092-15099, 39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025, Philadelphia, United States, 25/02/25. https://doi.org/10.1609/aaai.v39i14.33655, conference