This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
We present a logic for reasoning about strategic games. The logic is a modal formalism, based on the Coalition Logic of Propositional Control, to which we add the notions of outco...
Nicolas Troquard, Wiebe van der Hoek, Michael Wool...
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
We present an anytime multiagent learning approach to satisfy any given optimality criterion in repeated game self-play. Our approach is opposed to classical learning approaches fo...
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...