Sciweavers

1698 search results - page 25 / 340
» Growing Complex Games
Sort
View
CROSSROADS
2007
113views more  CROSSROADS 2007»
14 years 9 months ago
On the complexity of Katamari Damacy
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...
Gregory M. Zaverucha
AUSAI
2007
Springer
15 years 3 months ago
Dialogue Games in Defeasible Logic
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...
Subhasis Thakur, Guido Governatori, Vineet Padmana...
LOGCOM
2002
100views more  LOGCOM 2002»
14 years 9 months ago
Model Checking Games for Branching Time Logics
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...
Martin Lange, Colin Stirling
CPC
2002
75views more  CPC 2002»
14 years 9 months ago
The Minesweeper Game: Percolation And Complexity
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 ...
Elchanan Mossel
JSAC
2008
140views more  JSAC 2008»
14 years 9 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
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...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham