Sciweavers

356 search results - page 6 / 72
» Graph Games on Ordinals
Sort
View
CORR
2012
Springer
229views Education» more  CORR 2012»
13 years 5 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
AAAI
2010
14 years 11 months ago
Symmetry Detection in General Game Playing
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...
Stephan Schiffel
FSTTCS
2008
Springer
14 years 10 months ago
Average-Time Games
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 ...
Marcin Jurdzinski, Ashutosh Trivedi
JCT
2007
85views more  JCT 2007»
14 years 9 months ago
Avoider-Enforcer games
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...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
CORR
2010
Springer
125views Education» more  CORR 2010»
14 years 9 months ago
Iterated Regret Minimization in Game Graphs
Iterated regret minimization has been introduced recently by J.Y. Halpern and R. Pass in classical strategic games. For many games of interest, this new solution concept provides s...
Emmanuel Filiot, Tristan Le Gall, Jean-Franç...