Follow
Karel Horák
Karel Horák
Department of Computer Science, Czech Technical University in Prague
Verified email at agents.fel.cvut.cz
Title
Cited by
Cited by
Year
Manipulating adversary’s belief: A dynamic game approach to deception by design for proactive network security
K Horák, Q Zhu, B Bošanský
Decision and Game Theory for Security: 8th International Conference, GameSec …, 2017
1142017
Heuristic search value iteration for one-sided partially observable stochastic games
K Horák, B Bošanský, M Pěchouček
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
652017
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
502019
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
452019
Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs.
K Horák, B Bosanský, K Chatterjee
IJCAI, 4764-4770, 2018
222018
A point-based approximate algorithm for one-sided partially observable pursuit-evasion games
K Horák, B Bošanský
Decision and Game Theory for Security: 7th International Conference, GameSec …, 2016
192016
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ý
Decision and Game Theory for Security: 8th International Conference, GameSec …, 2017
172017
Solving zero-sum one-sided partially observable stochastic games
K Horák, B Bošanský, V Kovařík, C Kiekintveld
Artificial Intelligence 316, 103838, 2023
162023
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
162019
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
122018
Scalable algorithms for solving stochastic games with limited partial observability
K Horák
PQDT-Global, 2020
112020
Dynamic programming for one-sided partially observable pursuit-evasion games
K Horák, B Bošanský
arXiv preprint arXiv:1606.06271, 2016
72016
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
62016
Solving partially observable stochastic shortest-path games
P Tomášek, K Horák, A Aradhye, B Bošanský, K Chatterjee
Proceedings of the Thirtieth International Joint Conference on Artificial …, 2021
22021
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
12020
Scalable Algorithms for Solving Stochastic Games with Limited Partial Observability/Škálovatelné algoritmy pro Řešení Stochastických her s Omezenou Částečnou Pozorovatelností
K Horák
Czech Technical University, 2019
2019
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
The system can't perform the operation now. Try again later.
Articles 1–17