800 search results - page 54 / 160 » On the Complexity of Parity Games |
SAGT
2010
Springer
13 years 7 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
TCS
2010
13 years 7 months ago
2010
The concept of stigmergy provides a simple framework for interaction and coordination in multi-agent systems. However, determining the global system behavior that will arise from ...
DIGRA
2005
Springer
14 years 2 months ago
2005
Springer
This paper explores the implications and uptakes of game developers’ increasing reliance on the creative labour of fan content creators. It draws on an ethnographic account of A...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
GI
2009
Springer
13 years 7 months ago
2009
Springer
: ConnectIT uses a graphical representation to express strategies for playing the connect-four game. With this tool we can transfer complex knowledge about the connect-four game it...