Sciweavers

355 search results - page 2 / 71
» On Ramsey-type positional games
Sort
View
CONCUR
2005
Springer
13 years 10 months ago
Games Where You Can Play Optimally Without Any Memory
Abstract. Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, t...
Hugo Gimbert, Wieslaw Zielonka
ACG
2003
Springer
13 years 10 months ago
Learning to Score Final Positions in the Game of Go
Erik C. D. van der Werf, H. Jaap van den Herik, Jo...
ENDM
2007
85views more  ENDM 2007»
13 years 5 months ago
Fast winning strategies in positional games
For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker’...
Dan Hefetz, Michael Krivelevich, Milos Stojakovic,...
ACG
2009
Springer
13 years 12 months ago
Incongruity-Based Adaptive Game Balancing
Abstract. Commercial games have various methods of game balancing, which modify the game’s entertainment value for players of different skill levels. This paper presents a way o...
Giel van Lankveld, Pieter Spronck, H. Jaap van den...
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
13 years 11 months 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