A parameterized family of equilibrium profiles for three-player kuhn poker
暂无分享,去创建一个
[1] Tuomas Sandholm,et al. Lossless abstraction of imperfect information games , 2007, JACM.
[2] Christos H. Papadimitriou,et al. Three-Player Games Are Hard , 2005, Electron. Colloquium Comput. Complex..
[3] Michael H. Bowling,et al. Bayes' Bluff: Opponent Modelling in Poker , 2005, UAI 2005.
[4] Tuomas Sandholm,et al. Computing equilibria by incorporating qualitative models? , 2010, AAMAS.
[5] H. W. Kuhn,et al. 11. Extensive Games and the Problem of Information , 1953 .
[6] Duane Szafron,et al. Using counterfactual regret minimization to create competitive multiplayer poker agents , 2010, AAMAS.
[7] Bill Chen,et al. The Mathematics of Poker , 2006 .
[8] Kevin Waugh,et al. Monte Carlo Sampling for Regret Minimization in Extensive Games , 2009, NIPS.
[9] Bret Hoehn,et al. Effective short-term opponent exploitation in simplified poker , 2005, Machine Learning.
[10] J. Nash. Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.
[11] Michael H. Bowling,et al. Regret Minimization in Games with Incomplete Information , 2007, NIPS.
[12] Joel Veness,et al. A Monte-Carlo AIXI Approximation , 2009, J. Artif. Intell. Res..
[13] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[14] Avi Pfeffer,et al. Representations and Solutions for Game-Theoretic Problems , 1997, Artif. Intell..
[15] L. S. Shapley,et al. 10. A SIMPLE THREE-PERSON POKER GAME , 1951 .