In this paper, we provide two compositional algorithms to solve safety games and apply them to provide compositional algorithms for the LTL synthesis problem. We have implemented t...
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
We present an algorithm that identifies the reasoning patterns of agents in a game, by iteratively examining the graph structure of its Multi-Agent Influence Diagram (MAID) repres...
To increase the depth and appeal of computer games, the intelligence of the characters they contain needs to be increased. These characters should be played by intelligent agents ...
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...