ATL with Strategy Contexts and Bounded Memory
We extend the alternating-time temporal logics ATL and ATL* with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the strategies being executed by the other players. The second extension allows strategy quantifiers to restrict to memoryless or bounded-memory strategies.
We first 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 then 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.
KeywordsNash Equilibrium Model Check Temporal Logic Atomic Proposition Strategy Logic
Unable to display preview. Download preview PDF.
- 1.Ågotnes, T., Goranko, V., Jamroga, W.: Alternating-time temporal logics with irrevocable strategies. In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2007), pp. 15–24 (June 2007)Google Scholar
- 4.Brihaye, T., Costa, A.D., Laroussinie, F., Markey, N.: ATL with strategy contexts and bounded memory. Technical Report LSV-08-14, Lab. Specification et Verification (February 2008)Google Scholar
- 15.Schobbens, P.-Y.: Alternating-time logic with imperfect recall. In: Proceedings of the 1st Workshop on Logic and Communication in Multi-Agent Systems (LCMAS 2003). ENTCS, vol. 85. Elsevier, Amsterdam (2004)Google Scholar