The following publications are possibly variants of this publication:
- Approximating maxmin strategies in imperfect recall games using A-loss recall propertyJirí Cermák, Branislav Bosanský, Karel Horák, Viliam Lisý, Michal Pechoucek. ijar, 93:290-326, 2018. [doi]
- Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall GamesJirí Cermák, Branislav Bosanský, Michal Pechoucek. atal 2017: 902-910 [doi]
- Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall GamesJiri Cermak, Branislav Bosanský, Michal Pechoucek. AAAI 2017: [doi]
- An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form GamesJiri Cermak, Branislav Bosanský, Viliam Lisý. IJCAI 2017: 936-942 [doi]
- Automated construction of bounded-loss imperfect-recall abstractions in extensive-form gamesJirí Cermák, Viliam Lisý, Branislav Bosanský. ai, 282:103248, 2020. [doi]