Alternating-time temporal logic
Journal of the ACM (JACM)
Extensive Games as Process Models
Journal of Logic, Language and Information
Dynamic Decision-Making in Logic Programming and Game Theory
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Logic for Modeling Decision Making with Dynamic Preferences
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
A logic for strategic reasoning
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Reasoning about protocol change and knowledge
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Neighbourhood structure in large games
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Strategies in games: a logic-automata study
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
| Hi-index | 0.00 |
We suggest that a process-like notion of strategy is relevant in the context of interactions in systems of self-interested agents. In this view, strategies are not plans formulated by rational agents considering all possible futures and (mutually recursively) taking into account strategies employed by other players. Instead, they are partial; players start with a set of potential strategies and dynamically switch between them. This necessitates some means in the model for players to access each others' strategies, and we suggest a syntax by which players' rationale for such switching may be specified and structurally composed. In such a model one can ask a stability question: given a game arena and a strategy specification, whether players eventually settle down to strategies without further switching. We show that this problem can be algorithmically solved using automata theoretic methods.