On composition of bounded-recall plans
type: Item
instance of: scholarly article
title: On composition of bounded-recall plans
zbMATH Open document ID: 1504.68237
author: Kaya Deuser
author: Pavel Naumov
published in: Artificial Intelligence
publication date: 2021-08-16T00:00:00Z
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 7382233
MaRDI profile type: Publication
full work available at URL: j.artint.2020.103399
OpenAlex ID: W3091994162
cites work: Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
cites work: Finite automata play the repeated prisoner's dilemma
cites work: On complexity as bounded rationality (extended abstract)
cites work: Rationality and bounded rationality
cites work: Multiagent Systems
cites work: Evolutionary stability in repeated games played by finite automata
cites work: Bounded memory Dolev-Yao adversaries in collaborative systems
cites work: Improving active Mealy machine learning for protocol conformance testing
cites work: Better Quality in Synthesis through Quantitative Objectives
cites work: Navigability with intermediate constraints
cites work: A Modal Logic for Coalitional Power in Games
cites work: On the logic of cooperation and propositional control
cites work: Group announcement logic
cites work: Reasoning about coalitional games
cites work: Q4994888
cites work: Calculus of cooperation and game-based reasoning about protocol privacy
cites work: Logic for coalitions with bounded resources
cites work: Alternating-time temporal logic
cites work: Complete axiomatization and decidability of alternating-time temporal logic
cites work: Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
cites work: Q5422030
cites work: The deliberative stit: A study of action, omission, ability, and obligation
cites work: ACTION TYPES IN STIT SEMANTICS
cites work: Strategy logic
cites work: Reasoning About Strategies
cites work: Q5144683
cites work: Graded modalities in strategy logic
cites work: Constructive knowledge: what agents can achieve under imperfect information
cites work: Q4681371
cites work: Games in Dynamic-Epistemic Logic
cites work: Coalition logic with individual, distributed and common knowledge1
cites work: Q3384085
cites work: A Logic of Knowing How
cites work: A logic of goal-directed knowing how
cites work: Achieving While Maintaining:
cites work: Planning with Incomplete Information
cites work: An axiomatic basis for computer programming
cites work: One-Path Reachability Logic
cites work: A logic of strategic ability under bounded memory
cites work: ATL with Strategy Contexts and Bounded Memory
cites work: Q4992516
cites work: Q4050122
cites work: Q5320764
DOI: 10.1016/J.ARTINT.2020.103399
description: scientific article; zbMATH DE number 7382233