| Optimal network security hardening using attack graph games K Durkota, V Lisy, B Bošansky, C Kiekintveld Proceedings of IJCAI, 7-14, 2015 | 151 | 2015 |
| 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 | 117 | 2017 |
| An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information B Bosansky, C Kiekintveld, V Lisy, M Pechoucek Journal of Artificial Intelligence Research 51, 829-866, 2014 | 117 | 2014 |
| Game theoretic model of strategic honeypot selection in computer networks R Píbil, V Lisý, C Kiekintveld, B Bošanský, M Pěchouček Decision and Game Theory for Security: Third International Conference …, 2012 | 116 | 2012 |
| Computing time-dependent policies for patrolling games with mobile targets B Bošanský, V Lisý, M Jakob, M Pechoucek AAMAS. IFAAMAS, 2011 | 96 | 2011 |
| Game-theoretic resource allocation for malicious packet detection in computer networks. O Vanek, Z Yin, M Jain, B Bosanský, M Tambe, M Pechoucek AAMAS, 905-912, 2012 | 70 | 2012 |
| 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 | 66 | 2017 |
| Approximate solutions for attack graph games with imperfect information K Durkota, V Lisý, B Bošanský, C Kiekintveld Decision and Game Theory for Security: 6th International Conference, GameSec …, 2015 | 60 | 2015 |
| Using correlated strategies for computing stackelberg equilibria in extensive-form games J Cermak, B Bosansky, K Durkota, V Lisy, C Kiekintveld Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016 | 56 | 2016 |
| 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 | 53 | 2019 |
| Sequence-form algorithm for computing stackelberg equilibria in extensive-form games B Bosansky, J Cermak Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015 | 53 | 2015 |
| Algorithms for computing strategies in two-player simultaneous move games B Bošanský, V Lisý, M Lanctot, J Čermák, MHM Winands Artificial Intelligence 237, 1-40, 2016 | 52 | 2016 |
| 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 | 49 | 2019 |
| Transiting areas patrolled by a mobile adversary O Vaněk, B Bošanský, M Jakob, M Pěchouček Proceedings of the 2010 IEEE Conference on Computational Intelligence and …, 2010 | 49 | 2010 |
| Case Studies of Network Defense with Attack Graph Games K Durkota, V Lisy, C Kiekintveld, B Bosansky, M Pechoucek IEEE Intelligent Systems 31 (5), 24 - 30, 2016 | 47 | 2016 |
| Comparing Strategic Secrecy and Stackelberg Commitment in Security Games. Q Guo, B An, B Bosanský, C Kiekintveld IJCAI, 3691-3699, 2017 | 46 | 2017 |
| Combining compact representation and incremental generation in large games with sequential strategies B Bosansky, AX Jiang, M Tambe, C Kiekintveld Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015 | 46 | 2015 |
| Game-theoretic approach to adversarial plan recognition V Lisý, R Píbil, J Stiborek, B Bošanský, M Pěchouček ECAI 2012, 546-551, 2012 | 36* | 2012 |
| Hardening networks against strategic attackers using attack graph games K Durkota, V Lisý, B Bošanský, C Kiekintveld, M Pěchouček Computers & Security 87, 101578, 2019 | 35 | 2019 |
| Game-theoretic algorithms for optimal network security hardening using attack graphs K Durkota, V Lisý, C Kiekintveld, B Bošanský Database 20, 4xPC, 2015 | 32 | 2015 |
Viliam LisýCzech Technical University in PragueDirección de correo verificada de fel.cvut.cz
