A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games. - Karel Horák 002; Branislav Bosanský (GameSec, 2016)

Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games. - Karel Horák 002; Branislav Bosanský; Michal Pechoucek (AAAI, 2017)

Optimal Strategies for Detecting Data Exfiltration by Internal and External Attackers. - Karel Durkota; Viliam Lisý; Christopher Kiekintveld; Karel Horák 002; Branislav Bosanský; Tomás Pevný (GameSec, 2017)

Manipulating Adversary's Belief: A Dynamic Game Approach to Deception by Design for Proactive Network Security. - Karel Horák 002; Quanyan Zhu; Branislav Bosanský (GameSec, 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)

Dynamic Programming for One-sided Partially Observable Pursuit-evasion Games. - Karel Horák 002; Branislav Bosanský (ICAART (2), 2017)

Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs. - Karel Horák 002; Branislav Bosanský; Krishnendu Chatterjee (IJCAI, 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)

Solving Partially Observable Stochastic Games with Public Observations. - Karel Horák 002; Branislav Bosanský (AAAI, 2019)

Compact Representation of Value Function in Partially Observable Stochastic Games. - Karel Horák 002; Branislav Bosanský; Christopher Kiekintveld; Charles A. Kamhoua (IJCAI, 2019)

Optimizing honeypot strategies against dynamic lateral movement using partially observable stochastic games. - Karel Horák 002; Branislav Bosanský; Petr Tomásek; Christopher Kiekintveld; Charles A. Kamhoua (Comput. Secur., 2019)

Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection. - Olga Petrova; Karel Durkota; Galina Alperovich; Karel Horák 002; Michal Najman; Branislav Bosanský; Viliam Lisý (AAMAS, 2020)

Solving Partially Observable Stochastic Shortest-Path Games. - Petr Tomásek; Karel Horák 002; Aditya Aradhye; Branislav Bosanský; Krishnendu Chatterjee (IJCAI, 2021)

Solving zero-sum one-sided partially observable stochastic games. - Karel Horák 002; Branislav Bosanský; Vojtech Kovarík; Christopher Kiekintveld (Artif. Intell., 2023)

Iterative algorithms for solving one-sided partially observable stochastic shortest path games. - Petr Tomásek; Karel Horák 002; Branislav Bosanský (Int. J. Approx. Reason., 2024)