Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games. - Branislav Bosanský; Christopher Kiekintveld; Viliam Lisý; Jiri Cermak; Michal Pechoucek (AAMAS, 2013)

Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games. - Branislav Bosanský; Viliam Lisý; Jiri Cermak; Roman Vitek; Michal Pechoucek (IJCAI, 2013)

Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games. - Jirí Cermák; Branislav Bosanský; Viliam Lisý (ECAI, 2014)

Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games. - Branislav Bosanský; Jiri Cermak (AAAI, 2015)

Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games. - Jirí Cermák; Branislav Bosanský; Nicola Gatti 001 (AAMAS, 2015)

Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games. - Jiri Cermak; Branislav Bosanský; Karel Durkota; Viliam Lisý; Christopher Kiekintveld (AAAI, 2016)

Algorithms for computing strategies in two-player simultaneous move games. - Branislav Bosanský; Viliam Lisý; Marc Lanctot; Jirí Cermák; Mark H. M. Winands (Artif. Intell., 2016)

Towards Solving Imperfect Recall Games. - Jiri Cermak; Branislav Bosanský (AAAI Workshops, 2017)

Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. - Jiri Cermak; Branislav Bosanský; Michal Pechoucek (AAAI Workshops, 2017)

Solving Imperfect Recall Games. - Jirí Cermák (AAMAS, 2017)

Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall. - Branislav Bosanský; Jiri Cermak; Karel Horák 002; Michal Pechoucek (ICAART (2), 2017)

An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games. - Jiri Cermak; Branislav Bosanský; Viliam Lisý (IJCAI, 2017)

Learning with proxy supervision for end-to-end visual learning. - Jiri Cermak; Anelia Angelova (Intelligent Vehicles Symposium, 2017)

Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games. - Jiri Cermak; Viliam Lisý; Branislav Bosanský (CoRR, 2018)

Approximating maxmin strategies in imperfect recall games using A-loss recall property. - Jirí Cermák; Branislav Bosanský; Karel Horák 002; Viliam Lisý; Michal Pechoucek (Int. J. Approx. Reason., 2018)

Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract). - Jirí Cermák; Viliam Lisý; Branislav Bosanský (IJCAI, 2020)

Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games. - Jirí Cermák; Viliam Lisý; Branislav Bosanský (Artif. Intell., 2020)