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 31th AAAI Conference on Artificial Intelligence. The 31th AAAI Conference on Artificial Intelligence, San Francisco, 2017-02-04/2017-02-09. Menlo Park: AAAI Press, 2017. pp. 902-910. ISBN 978-1-57735-786-5.

URL: https://www.researchgate.net/publication/317095657_Combining_incremental_strategy_generation_and_branch_and_bound_search_for_computing_maxmin_strategies_in_imperfect_recall_games