800 search results - page 59 / 160 » On the Complexity of Parity Games |
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
ESANN
2008
13 years 10 months ago
2008
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
CEC
2011
IEEE
12 years 9 months ago
2011
IEEE
—Games provide an ideal test bed for computational intelligence and significant progress has been made in recent years, most notably in games such as GO, where the level of play...
ATAL
2009
Springer
13 years 10 months ago
2009
Springer
MAGE (Multi-Agent Game Environment) is a logic-based framework that uses games as a metaphor for representing complex agent activities within an artificial society. More specifical...