22 search results - page 3 / 5 » Computing Weakest Strategies for Safety Games of Imperfect I... |
AAAI
2008
13 years 8 months ago
2008
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
CIG
2005
IEEE
13 years 8 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...
CIG
2006
IEEE
14 years 3 days ago
2006
IEEE
Abstract— Many games require opponent modelling for optimal performance. The implicit learning and adaptive nature of evolutionary computation techniques offer a natural way to d...
ATAL
2011
Springer
12 years 6 months ago
2011
Springer
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
STOC
1994
ACM
13 years 10 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...