Probabilistic Strategy Logic with Degrees of Observability

Chunyan Mu, Nima Motamed, Natasha Alechina, Brian Logan
12/19/2024
cs.AIcs.LO

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{mu2024probabilistic,
  title  = {Probabilistic Strategy Logic with Degrees of Observability},
  author = {Chunyan Mu and Nima Motamed and Natasha Alechina and Brian Logan},
  year   = {2024},
  eprint = {2412.15135},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.15135v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.15135.svg)](https://codeofpaper.com/paper/2412.15135)

Discussion