Relaxing Exclusive Control in Boolean Games - Archive ouverte HAL Access content directly
Journal Articles Electronic Proceedings in Theoretical Computer Science Year : 2017

Relaxing Exclusive Control in Boolean Games

Abstract

In the typical framework for boolean games (BG) each player can change the truth value of some propositional atoms, while attempting to make her goal true. In standard BG goals are propositional formulas, whereas in iterated BG goals are formulas of Linear Temporal Logic. Both notions of BG are characterised by the fact that agents have exclusive control over their set of atoms, meaning that no two agents can control the same atom. In the present contribution we drop the exclusivity assumption and explore structures where an atom can be controlled by multiple agents. We introduce Concurrent Game Structures with Shared Propositional Control (CGS-SPC) and show that they account for several classes of repeated games, including iterated boolean games, influence games, and aggregation games. Our main result shows that, as far as verification is concerned, CGS-SPC can be reduced to concurrent game structures with exclusive control. This result provides a polynomial reduction for the model checking problem of specifications in Alternating-time Temporal Logic on CGS-SPC.
Fichier principal
Vignette du fichier
TARK2017.pdf (213.43 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

hal-01625886 , version 1 (03-12-2021)

Licence

Identifiers

Cite

Francesco Belardinelli, Umberto Grandi, Andreas Herzig, Dominique Longin, Emiliano Lorini, et al.. Relaxing Exclusive Control in Boolean Games. Electronic Proceedings in Theoretical Computer Science, 2017, Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2017), 251, pp.43-56. ⟨10.4204/EPTCS.251.4⟩. ⟨hal-01625886⟩
328 View
28 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More