We analyze the complexity of the popular PlayStation 2 game, Katamari Damacy. In particular, we prove that playing Katamari Damacy optimally is NP-hard and that it cannot be appro...
In this paper we show how to capture dialogue games in Defeasible Logic. We argue that Defeasible Logic is a natural candidate and general representation formalism to capture dialo...
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...