Branislav Bošanský
Branislav Bošanský
Assistant Professor, Dept. of Computer Science, FEE, Czech Technical University in Prague
Verified email at agents.fel.cvut.cz - Homepage
Title
Cited by
Cited by
Year
Computing time-dependent policies for patrolling games with mobile targets
B Bošanský, V Lisý, M Jakob, M Pechoucek
AAMAS. IFAAMAS, 2011
842011
Optimal network security hardening using attack graph games
K Durkota, V Lisy, B Bošansky, C Kiekintveld
Proceedings of IJCAI, 7-14, 2015
762015
Game theoretic model of strategic honeypot selection in computer networks
R Píbil, V Lisý, C Kiekintveld, B Bošanský, M Pěchouček
International Conference on Decision and Game Theory for Security, 201-220, 2012
742012
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
692014
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
552017
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
502012
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
422015
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
422010
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
382016
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
342016
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
332017
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
332016
Approximate solutions for attack graph games with imperfect information
K Durkota, V Lisý, B Bošanský, C Kiekintveld
International Conference on Decision and Game Theory for Security, 228-249, 2015
322015
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
322015
Game-theoretic approach to adversarial plan recognition
V Lisý, R Píbil, J Stiborek, B Bošanský, M Pěchouček
Proceedings of the 20th European Conference on Artificial Intelligence, 546-551, 2012
262012
Comparing Strategic Secrecy and Stackelberg Commitment in Security Games.
Q Guo, B An, B Bosanský, C Kiekintveld
IJCAI, 3691-3699, 2017
242017
Game-theoretic algorithms for optimal network security hardening using attack graphs
K Durkota, V Lisy, C Kiekintveld, B Bosansky
Proceedings of the 2015 International Conference on Autonomous Agents and …, 2015
182015
Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games
B Bosansky, C Kiekintveld, V Lisy, J Cermak, M Pechoucek
Proceedings of the 2013 international conference on Autonomous agents and …, 2013
182013
Iterative game-theoretic route selection for hostile area transit and patrolling.
O Vanek, M Jakob, V Lisý, B Bosanský, M Pechoucek
AAMAS, 1273-1274, 2011
182011
Computation of Stackelberg equilibria of finite sequential games
B Bošanský, S Brânzei, KA Hansen, TB Lund, PB Miltersen
ACM Transactions on Economics and Computation (TEAC) 5 (4), 1-24, 2017
172017
The system can't perform the operation now. Try again later.
Articles 1–20