Sciweavers

800 search results - page 39 / 160
» On the Complexity of Parity Games
Sort
View
IJFCS
2002
72views more  IJFCS 2002»
13 years 9 months ago
On the Complexity of Computing Values of Restricted Games
Jesús Mario Bilbao, J. R. Fernández,...
EVOW
2010
Springer
14 years 4 months ago
Evolving Behaviour Trees for the Commercial Game DEFCON
Abstract. Behaviour trees provide the possibility of improving on existing Artificial Intelligence techniques in games by being simple to implement, scalable, able to handle the c...
Chong-U Lim, Robin Baumgarten, Simon Colton
DIGRA
2005
Springer
14 years 2 months ago
Law, order and conflicts of interest in massively multiplayer online games
In huge online games where great numbers of players can be connected at the same time, social interaction is complex and conflicts become part of everyday life. There is a set of ...
Daniel Pargman, Andreas Eriksson
ICALP
2005
Springer
14 years 2 months ago
Recursive Markov Decision Processes and Recursive Stochastic Games
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
Kousha Etessami, Mihalis Yannakakis