19 search results - page 3 / 4 » Lossless abstraction of imperfect information games |
COCOON
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show that a max...
SARA
2009
Springer
14 years 9 days ago
2009
Springer
Perfect recall is the common and natural assumption that an agent never forgets. As a consequence, the agent can always condition its choice of action on any prior observations. I...
JANCL
2007
13 years 5 months ago
2007
ABSTRACT. We formulate a formal framework in which we combine the theory of dynamic epistemic logic and the theory of games. In particular, we show how we can use tools of dynamic ...
CIG
2006
IEEE
13 years 11 months 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 5 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...