14 search results - page 1 / 3 » Game theory-based opponent modeling in large imperfect-infor... |
ATAL
2011
Springer
12 years 4 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...
AAAI
2006
13 years 5 months ago
2006
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
Opponent models are necessary in games where the game state is only partially known to the player, since the player must infer the state of the game based on the opponent’s acti...
CG
2004
Springer
13 years 10 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...
CIG
2006
IEEE
13 years 10 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...