Manipulating adversary’s belief: A dynamic game approach to deception by design for proactive network security K Horák, Q Zhu, B Bošanský International Conference on Decision and Game Theory for Security, 273-294, 2017 | 61 | 2017 |

Heuristic search value iteration for one-sided partially observable stochastic games K Horák, B Bošanský, M Pěchouček Thirty-First AAAI Conference on Artificial Intelligence, 2017 | 38 | 2017 |

Solving partially observable stochastic games with public observations K Horák, B Bošanský Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2029-2036, 2019 | 17 | 2019 |

A point-based approximate algorithm for one-sided partially observable pursuit-evasion games K Horák, B Bošanský International Conference on Decision and Game Theory for Security, 435-454, 2016 | 14 | 2016 |

Optimal strategies for detecting data exfiltration by internal and external attackers K Durkota, V Lisý, C Kiekintveld, K Horák, B Bošanský, T Pevný International Conference on Decision and Game Theory for Security, 171-192, 2017 | 11 | 2017 |

Optimizing honeypot strategies against dynamic lateral movement using partially observable stochastic games K Horák, B Bošanský, P Tomášek, C Kiekintveld, C Kamhoua Computers & Security 87, 101579, 2019 | 9 | 2019 |

Approximating maxmin strategies in imperfect recall games using A-loss recall property J Čermák, B Bošanský, K Horák, V Lisý, M Pěchouček International Journal of Approximate Reasoning 93, 290-326, 2018 | 8 | 2018 |

Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs. K Horák, B Bosanský, K Chatterjee IJCAI, 4764-4770, 2018 | 8 | 2018 |

Compact representation of value function in partially observable stochastic games K Horák, B Bošanský, C Kiekintveld, C Kamhoua arXiv preprint arXiv:1903.05511, 2019 | 5 | 2019 |

Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall B Bosansky, J Cermak, K Horak, M Pechoucek arXiv preprint arXiv:1608.01510, 2016 | 4 | 2016 |

Dynamic programming for one-sided partially observable Pursuit-Evasion games K Horák, B Bošanský arXiv preprint arXiv:1606.06271, 2016 | 3 | 2016 |

Solving Zero-Sum One-Sided Partially Observable Stochastic Games K Horák, B Bošanský, V Kovařík, C Kiekintveld arXiv preprint arXiv:2010.11243, 2020 | 1 | 2020 |

Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection O Petrova, K Durkota, G Alperovich, K Horak, M Najman, B Bosansky, ... arXiv preprint arXiv:2004.10638, 2020 | 1 | 2020 |

Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall B Bošanský, J Cermák, K Horák, M Pechoucek arXiv preprint arXiv:1608.01510, 2016 | | 2016 |

Solving Partially Observable Stochastic Shortest-Path Games P Tomášek, K Horák, A Aradhye, B Bošanský, K Chatterjee | | |