A logic of strategic ability under bounded memory

Journal of Logic, Language and Information 18 (1):55-77 (2009)
  Copy   BIBTEX

Abstract

We study the logic of strategic ability of coalitions of agents with bounded memory by introducing Alternating-time Temporal Logic with Bounded Memory (ATLBM), a variant of Alternating-time Temporal Logic (ATL). ATLBM accounts for two main consequences of the assumption that agents have bounded memory. First, an agent can only remember a strategy that specifies actions in a bounded number of different circumstances. While the ATL-formula means that coalition C has a joint strategy which will make φ true forever, the ATLBM-formula means that C has a joint strategy which for each agent in C specifies what to do in no more than n different circumstances and which will make φ true forever. Second, an agent has bounded recall—a strategy can only take the last m states of the system into account. We use the logic to study the interaction between strategic ability, bounded number of decisions, bounded recall and incomplete information. We discuss the logical properties and expressiveness of ATLBM, and its relationship to ATL. We show that ATLBM can express properties of strategic ability under bounded memory which cannot be expressed in ATL.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
5 (#1,562,871)

6 months
70 (#75,308)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Springer International Publishing. pp. 289-337.
Natural strategic ability.Wojciech Jamroga, Vadim Malvone & Aniello Murano - 2019 - Artificial Intelligence 277 (C):103170.
On composition of bounded-recall plans.Kaya Deuser & Pavel Naumov - 2020 - Artificial Intelligence 289 (C):103399.

Add more citations