Bayes-Relational Learning of Opponent Models from Incomplete Information in No-Limit Poker
暂无分享,去创建一个
We propose an opponent modeling approach for NoLimit Texas Hold’em poker that starts from a (learned) prior, i.e., general expectations about opponent behavior and learns a relational regression tree-function that adapts these priors to specific opponents. An important asset is that this approach can learn from incomplete information (i.e. without knowing all players’ hands in training games).
[1] Hendrik Blockeel,et al. Top-Down Induction of First Order Logical Decision Trees , 1998, AI Commun..
[2] Jonathan Schaeffer,et al. Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games , 2004, Computers and Games.
[3] Jonathan Schaeffer,et al. Improved Opponent Modeling in Poker , 2000 .