Strategies in Sabotage Games: Temporal and Epistemic Perspectives

View PDF HTML (experimental)

Abstract:Sabotage games are played on a dynamic graph, in which one agent, called a runner, attempts to reach a goal state, while being obstructed by a demon who at each round removes an edge from the graph. Sabotage modal logic was proposed to carry out reasoning about such games. Since its conception, it has undergone a thorough analysis (in terms of complexity, completeness, and various extensions) and has been applied to a variety of domains, e.g., to formal learning. In this paper, we propose examining the game from a temporal perspective using alternating time temporal logic (ATL$^\ast$), and address the players' uncertainty in its epistemic extensions. This framework supports reasoning about winning strategies for those games, and opens ways to address temporal properties of dynamic graphs in general.

Comments: 18 pages, 3 figures

Subjects:

Logic in Computer Science (cs.LO); Multiagent Systems (cs.MA)

Cite as: arXiv:2604.03872 [cs.LO]

(or arXiv:2604.03872v1 [cs.LO] for this version)

https://doi.org/10.48550/arXiv.2604.03872

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Nina Gierasimczuk [view email] [v1] Sat, 4 Apr 2026 21:38:15 UTC (100 KB)