Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games

Jiri Cermak, Branislav Bosanský, Michal Pechoucek. Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. In The Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, Saturday, February 4-9, 2017, San Francisco, California, USA. AAAI Workshops, AAAI Press, 2017. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.