214 search results - page 7 / 43 » Finding Optimal Strategies for Imperfect Information Games |
CG
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Years of work have gone into algorithms and optimizations for twoplayer perfect-information games such as Chess and Checkers. It is only more recently that serious resear...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
CIG
2005
IEEE
13 years 9 months ago
2005
IEEE
Abstract- Monte Carlo simulations have been successfully used in classic turn–based games such as backgammon, bridge, poker, and Scrabble. In this paper, we apply the ideas to th...
AAAI
2010
13 years 9 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
We consider timed games extended with cost information, and prove computability of the optimal cost and of -optimal memoryless strategies in timed games with one clock. In contrast...