Bibtex de la publication

@InProceedings{ Be2017.13,
author = {Belardinelli, Francesco and Grandi, Umberto and Herzig, Andreas and Longin, Dominique and Lorini, Emiliano and Novaro, Arianna and Perrussel, Laurent},
title = "{Relaxing Exclusive Control in Boolean Games (regular paper)}",
booktitle = "{Conference on Theoretical Aspects of Rationality and Knowledge (TARK), Liverpool, 24/07/2017-26/07/2017}",
editor = {Lang, Jérôme},
year = {2017},
publisher = {Electronic Proceedings in Theoretical Computer Science},
address = {http://about.eptcs.org/},
volume = {251},
pages = {43--56},
language = {anglais},
URL = {https://www.irit.fr/publis/LILAC/Conf_internationales/2017_Belardinelli_et_al_TARK.pdf},
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.}
}