533 search results - page 48 / 107 » Playing games with approximation algorithms |
NN
2006
Springer
13 years 7 months ago
2006
Springer
Previous studies have shown that non-human primates can generate highly stochastic choice behaviour, especially when this is required during a competitive interaction with another...
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....
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
SAGA
2007
Springer
14 years 1 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...