Sciweavers

3780 search results - page 14 / 756
» Algorithms for Game Metrics
Sort
View
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
AAAI
2010
13 years 9 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
13 years 8 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
CG
2010
Springer
13 years 5 months ago
Score Bounded Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
Tristan Cazenave, Abdallah Saffidine