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

Čermák, J., Bošanský, B., Pěchouček, M.

ČERMÁK, J., B. BOŠANSKÝ, and M. PĚCHOUČEK. Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems. 16th Conference on Autonomous Agents and MultiAgent Systems, São Paulo, 2017-05-08/2017-05-12. New York: ACM, 2017. pp. 902-910.

URL: https://dl.acm.org/citation.cfm?id=3091253