15 search results - page 2 / 3 » Answer Set Programming for Single-Player Games in General Ga... |
ECCC
2006
13 years 7 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
TCS
2010
13 years 5 months ago
2010
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
SAGT
2010
Springer
13 years 5 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
AI
2007
Springer
14 years 1 months ago
2007
Springer
Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve ...
ICGA
2008
13 years 7 months ago
2008
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....