344 search results - page 22 / 69 » Banach-Mazur Games on Graphs |
VALUETOOLS
2006
ACM
14 years 2 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
TEI
2009
ACM
14 years 3 months ago
2009
ACM
Graphs are a versatile representation of many systems in computer science, the social sciences, and mathematics, but graph theory is not taught in schools. We present our work on ...
AAAI
2010
13 years 10 months ago
2010
We develop a method for detecting symmetries in arbitrary games and exploiting these symmetries when using tree search to play the game. Games in the General Game Playing domain a...
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
JCT
2007
13 years 8 months ago
2007
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...