Skip to Main content Skip to Navigation
New interface

Propriétés de jeux multi-agents

Abstract : We extend the alternating-time temporal logics ATL and ATL* with strategy contexts and memory constraints: the first extension make agents commit to their strategies during the evaluation of formulas, contrary to plain ATL where strategy quantifiers reset previously selected strategies. The second extension allows strategy quantifiers to restrict to memoryless or bounded-memory strategies. We consider expressiveness issues. We show that our logics can express important properties such as equilibria, and we formally compare them with other similar formalisms (ATL, ATL*, Game Logic, Strategy Logic, ...). We address the problem of model-checking for our logics, especially we provide a PSPACE algorithm for the sublogics involving only memoryless strategies and an EXPSPACE algorithm for the bounded-memory case. In the general case, despite the high expressiveness of these logics, we prove that their model-checking problems remain decidable by designing a tree-automata-based algorithm for model-checking ATLsc on the full class of n-player concurrent game structures.
Document type :
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Wednesday, October 24, 2012 - 12:07:10 PM
Last modification on : Monday, February 15, 2021 - 10:39:42 AM
Long-term archiving on: : Friday, January 25, 2013 - 3:43:45 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00744970, version 1



Arnaud da Costa da Costa Lopes Lopes. Propriétés de jeux multi-agents. Autre [cs.OH]. École normale supérieure de Cachan - ENS Cachan, 2011. Français. ⟨NNT : 2011DENS0034⟩. ⟨tel-00744970⟩



Record views


Files downloads