approximating game-theoretic optimal strategies for full-scale poker（全面的扑克近似博弈论的最优策略）.pdfVIP

下载本文档

17
0
约5.9万字
约 8页
2017-07-25 发布于浙江
举报
版权申诉

approximating game-theoretic optimal strategies for full-scale poker（全面的扑克近似博弈论的最优策略）.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

approximating game-theoretic optimal strategies for full-scale poker（全面的扑克近似博弈论的最优策略）

Approximating Game-Theoretic Optimal Strategies for Full-scale Poker D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, and D. Szafron Department of Computing Science, University of Alberta Edmonton, Alberta, T6G 2E8, Canada Email: darse,burch,davidson,holte,jonathan,terence,duane @cs.ualberta.ca Abstract Due to the computational limitations involved, only simpli- ﬁed poker variations have been solved in the past (e.g. [Kuhn, The computation of the ﬁrst complete approxima- ] 1950; Sakaguchi and Sakai, 1992 ). While these are of the- tions of game-theoretic optimal strategies for full- oretical interest, the same methods are not feasible for real scale poker is addressed. Several abstraction tech- games, which are too large by many orders of magnitude niques are combined to represent the game of 2- [ ] ( Koller and Pfeffer, 1997 ). player Texas Hold’em, having size , using [Shi and Littman, 2001] investigated abstraction tech- closely related models each having size . niques to reduce the large search space and complexity of the Despite the reduction in size by a factor of 100 problem, using a simpliﬁed variant of poker. [Takusagawa, billion, the resulting models retain the key prop- 2000] created near-optimal strategies for the play of