Acquiring Strategies for the Board Game Geister by Regret Minimization
暂无分享,去创建一个
[1] Michael H. Bowling,et al. Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization , 2012, AAMAS.
[2] Neil Burch,et al. Heads-up limit hold’em poker is solved , 2015, Science.
[3] Michael H. Bowling,et al. Regret Minimization in Games with Incomplete Information , 2007, NIPS.
[4] Tuomas Sandholm,et al. Deep Counterfactual Regret Minimization , 2018, ICML.
[5] Kevin Waugh,et al. Monte Carlo Sampling for Regret Minimization in Extensive Games , 2009, NIPS.