Towards Approximately Optimal Poker

Jiefu Shi and Michael Littman, Duke University

Abstraction is a method one often applies to keep the combinatorial explosion under control and to solve problems of large complexity. Here, we apply this technique in approximating optimal strategies for large stochastic imperfect-information games. The specific game investigated is a two-player version of poker.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.