Relaxing Exclusive Control in Boolean Games - Archive ouverte HAL Access content directly
Conference Papers 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
belardinelli_19152.pdf (303.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01919061 , version 1 (12-11-2018)

Licence

Attribution

Identifiers

Cite

Francesco Belardinelli, Umberto Grandi, Andreas Herzig, Dominique Longin, Emiliano Lorini, et al.. Relaxing Exclusive Control in Boolean Games. 16th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2017), Jul 2017, Liverpool, United Kingdom. pp.43-56, ⟨10.48550/arXiv.1707.08736⟩. ⟨hal-01919061⟩
78 View
57 Download

Altmetric

Share

Gmail Facebook X LinkedIn More