Sciweavers

43 search results - page 3 / 9
» Complexity of comparison of influence of players in simple g...
Sort
View
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 10 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
EVOW
2010
Springer
14 years 1 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
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 25 days ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
ECAI
2006
Springer
13 years 10 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
13 years 8 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn