1319 search results - page 150 / 264 » Playing the Expert Game |
CEC
2007
IEEE
14 years 3 months ago
2007
IEEE
— In this paper, we report on our experiments with using Monte Carlo simulation (specifically the UCT algorithm) as the basis for an Othello playing program. Monte Carlo methods ...
COLT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We provide a natural learning process in which the joint frequency of empirical play converges into the set of convex combinations of Nash equilibria. In this process, al...
BIRTHDAY
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
C5
2006
IEEE
14 years 3 months ago
2006
IEEE
1 Creating one’s own games has been the main motivation for many people to learn programming. But the barrier to learn a general purpose programming language is very high, espec...