Branislav Bosanský

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 51

Top Topics

Perfect Information

Nash Equilibria

Network Security

Extended Abstract

Top Venues

Publications

Branislav Bosanský, Lada Hospodkova, Michal Najman, Maria Rigaki, Elnaz Babayeva, Viliam Lisý
Counteracting Concept Drift by Learning with Future Malware Predictions. CoRR (2024)
Jacopo Cortellazzi, Ilias Tsingenopoulos, Branislav Bosanský, Simone Aonzo, Davy Preuveneers, Wouter Joosen, Fabio Pierazzi, Lorenzo Cavallaro
How to Train your Antivirus: RL-based Hardening through the Problem-Space. CoRR (2024)
Md. Abu Sayed, Ahmed H. Anwar, Christopher Kiekintveld, Branislav Bosanský, Charles A. Kamhoua
Cyber Deception against Zero-day Attacks: A Game Theoretic Approach. CoRR (2023)
Karel Horák, Branislav Bosanský, Vojtech Kovarík, Christopher Kiekintveld
Solving zero-sum one-sided partially observable stochastic games. Artif. Intell. 316 (2023)
Tomás Pevný, Viliam Lisý, Branislav Bosanský, Petr Somol, Michal Pechoucek
Explaining Classifiers Trained on Raw Hierarchical Multiple-Instance Data. CoRR (2022)
Branislav Bosanský, Dominik Kouba, Ondrej Manhal, Thorsten Sick, Viliam Lisý, Jakub Kroustek, Petr Somol
Avast-CTU Public CAPE Dataset. CoRR (2022)
Md. Abu Sayed, Ahmed H. Anwar, Christopher Kiekintveld, Branislav Bosanský, Charles A. Kamhoua
Cyber Deception Against Zero-Day Attacks: A Game Theoretic Approach. GameSec (2022)
Aditya Aradhye, Branislav Bosanský, Michael Hlavácek
Computing Stackelberg Equilibrium with Memory in Sequential Games. CoRR (2021)
Marek Galovic, Branislav Bosanský, Viliam Lisý
Improving Robustness of Malware Classifiers using Adversarial Strings Generated from Perturbed Latent Representations. CoRR (2021)
Jakub Cerný, Viliam Lisý, Branislav Bosanský, Bo An
Computing Quantal Stackelberg Equilibrium in Extensive-Form Games. AAAI (2021)
Petr Tomásek, Karel Horák, Aditya Aradhye, Branislav Bosanský, Krishnendu Chatterjee
Solving Partially Observable Stochastic Shortest-Path Games. IJCAI (2021)
Karel Horák, Branislav Bosanský, Vojtech Kovarík, Christopher Kiekintveld
Solving Zero-Sum One-Sided Partially Observable Stochastic Games. CoRR (2020)
Petr Tomásek, Branislav Bosanský, Thanh Hong Nguyen
Using One-Sided Partially Observable Stochastic Games for Solving Zero-Sum Security Games with Sequential Attacks. GameSec (2020)
Jirí Cermák, Viliam Lisý, Branislav Bosanský
Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games. Artif. Intell. 282 (2020)
Jirí Cermák, Viliam Lisý, Branislav Bosanský
Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract). IJCAI (2020)
Jakub Cerný, Branislav Bosanský, Bo An
Finite State Machines Play Extensive-Form Games. EC (2020)
Olga Petrova, Karel Durkota, Galina Alperovich, Karel Horák, Michal Najman, Branislav Bosanský, Viliam Lisý
Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection. CoRR (2020)
Olga Petrova, Karel Durkota, Galina Alperovich, Karel Horák, Michal Najman, Branislav Bosanský, Viliam Lisý
Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection. AAMAS (2020)
Jakub Cerný, Viliam Lisý, Branislav Bosanský, Bo An
Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium. IJCAI (2020)
Karel Horák, Branislav Bosanský, Christopher Kiekintveld, Charles A. Kamhoua
Compact Representation of Value Function in Partially Observable Stochastic Games. IJCAI (2019)
Karel Horák, Branislav Bosanský, Petr Tomásek, Christopher Kiekintveld, Charles A. Kamhoua
Optimizing honeypot strategies against dynamic lateral movement using partially observable stochastic games. Comput. Secur. 87 (2019)
Thanh Hong Nguyen, Amulya Yadav, Branislav Bosanský, Yu Liang
Tackling Sequential Attacks in Security Games. GameSec (2019)
Marcus Gutierrez, Jakub Cerný, Noam Ben-Asher, Efrat Aharonov-Majar, Branislav Bosanský, Christopher Kiekintveld, Cleotilde Gonzalez
Evaluating Models of Human Behavior in an Adversarial Multi-Armed Bandit Problem. CogSci (2019)
Karel Durkota, Viliam Lisý, Branislav Bosanský, Christopher Kiekintveld, Michal Pechoucek
Hardening networks against strategic attackers using attack graph games. Comput. Secur. 87 (2019)
Karel Horák, Branislav Bosanský
Solving Partially Observable Stochastic Games with Public Observations. AAAI (2019)
Pavel Rytír, Lukás Chrpa, Branislav Bosanský
Using Classical Planning in Adversarial Problems. ICTAI (2019)
Xinrun Wang, Milind Tambe, Branislav Bosanský, Bo An
When Players Affect Target Values: Modeling and Solving Dynamic Partially Observable Security Games. GameSec (2019)
Karel Horák, Branislav Bosanský, Christopher Kiekintveld, Charles A. Kamhoua
Compact Representation of Value Function in Partially Observable Stochastic Games. CoRR (2019)
Jirí Cermák, Branislav Bosanský, Karel Horák, Viliam Lisý, Michal Pechoucek
Approximating maxmin strategies in imperfect recall games using A-loss recall property. Int. J. Approx. Reason. 93 (2018)
Karel Horák, Branislav Bosanský, Krishnendu Chatterjee
Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs. IJCAI (2018)
Anjon Basak, Jakub Cerný, Marcus Gutierrez, Shelby R. Curtis, Charles A. Kamhoua, Daniel Jones, Branislav Bosanský, Christopher Kiekintveld
An Initial Study of Targeted Personality Models in the FlipIt Game. GameSec (2018)
Jiri Cermak, Viliam Lisý, Branislav Bosanský
Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games. CoRR (2018)
Jakub Cerný, Branislav Bosanský, Christopher Kiekintveld
Incremental Strategy Generation for Stackelberg Equilibria in Extensive-Form Games. EC (2018)
Jiri Cermak, Branislav Bosanský
Towards Solving Imperfect Recall Games. AAAI Workshops (2017)
Jirí Cermák, Branislav Bosanský, Michal Pechoucek
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. AAMAS (2017)
Karel Horák, Branislav Bosanský, Michal Pechoucek
Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games. AAAI (2017)
Branislav Bosanský, Jiri Cermak, Karel Horák, Michal Pechoucek
Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall. ICAART (2) (2017)
Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Troels Bjerre Lund, Peter Bro Miltersen
Computation of Stackelberg Equilibria of Finite Sequential Games. ACM Trans. Economics and Comput. 5 (4) (2017)
Karel Horák, Quanyan Zhu, Branislav Bosanský
Manipulating Adversary's Belief: A Dynamic Game Approach to Deception by Design for Proactive Network Security. GameSec (2017)
Karel Horák, Branislav Bosanský
Dynamic Programming for One-sided Partially Observable Pursuit-evasion Games. ICAART (2) (2017)
Karel Durkota, Viliam Lisý, Christopher Kiekintveld, Karel Horák, Branislav Bosanský, Tomás Pevný
Optimal Strategies for Detecting Data Exfiltration by Internal and External Attackers. GameSec (2017)
Jiri Cermak, Branislav Bosanský, Michal Pechoucek
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. AAAI Workshops (2017)
Jiri Cermak, Branislav Bosanský, Viliam Lisý
An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games. IJCAI (2017)
Qingyu Guo, Bo An, Branislav Bosanský, Christopher Kiekintveld
Comparing Strategic Secrecy and Stackelberg Commitment in Security Games. IJCAI (2017)
Qingyu Guo, Bo An, Branislav Bosanský, Christopher Kiekintveld
Strategic Information Revelation and Commitment in Security Games. AAAI Workshops (2017)
Karel Durkota, Viliam Lisý, Christopher Kiekintveld, Branislav Bosanský, Michal Pechoucek
Case Studies of Network Defense with Attack Graph Games. IEEE Intell. Syst. 31 (5) (2016)
Karel Horák, Branislav Bosanský
Dynamic Programming for One-Sided Partially Observable Pursuit-Evasion Games. CoRR (2016)
Branislav Bosanský, Viliam Lisý, Marc Lanctot, Jirí Cermák, Mark H. M. Winands
Algorithms for computing strategies in two-player simultaneous move games. Artif. Intell. 237 (2016)
Jiri Cermak, Branislav Bosanský, Karel Durkota, Viliam Lisý, Christopher Kiekintveld
Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games. AAAI (2016)
Karel Horák, Branislav Bosanský
A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games. GameSec (2016)
Branislav Bosanský, Jiri Cermak, Karel Horák, Michal Pechoucek
Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall. CoRR (2016)
Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Computation of Stackelberg Equilibria of Finite Sequential Games. WINE (2015)
Branislav Bosanský, Albert Xin Jiang, Milind Tambe, Christopher Kiekintveld
Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies. AAAI (2015)
Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Computation of Stackelberg Equilibria of Finite Sequential Games. CoRR (2015)
Karel Durkota, Viliam Lisý, Christopher Kiekintveld, Branislav Bosanský
Game-Theoretic Algorithms for Optimal Network Security Hardening Using Attack Graphs. AAMAS (2015)
Jirí Cermák, Branislav Bosanský, Nicola Gatti
Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games. AAMAS (2015)
Branislav Bosanský, Jiri Cermak
Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games. AAAI (2015)
Karel Durkota, Viliam Lisý, Branislav Bosanský, Christopher Kiekintveld
Approximate Solutions for Attack Graph Games with Imperfect Information. GameSec (2015)
Karel Durkota, Viliam Lisý, Branislav Bosanský, Christopher Kiekintveld
Optimal Network Security Hardening Using Attack Graph Games. IJCAI (2015)
Michal Abaffy, Tomás Brázdil, Vojtech Rehák, Branislav Bosanský, Antonín Kucera, Jan Krcál
Solving adversarial patrolling games with bounded error: (extended abstract). AAMAS (2014)
Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Michal Pechoucek
An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information. J. Artif. Intell. Res. 51 (2014)
Jirí Cermák, Branislav Bosanský, Viliam Lisý
Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games. ECAI (2014)
Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Jiri Cermak, Michal Pechoucek
Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games. AAMAS (2013)
Branislav Bosanský
Solving extensive-form games with double-oracle methods. AAMAS (2013)
Viliam Lisý, Vojtech Kovarík, Marc Lanctot, Branislav Bosanský
Convergence of Monte Carlo Tree Search in Simultaneous Move Games. CoRR (2013)
Branislav Bosanský, Viliam Lisý, Jiri Cermak, Roman Vitek, Michal Pechoucek
Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games. IJCAI (2013)
Viliam Lisý, Vojtech Kovarík, Marc Lanctot, Branislav Bosanský
Convergence of Monte Carlo Tree Search in Simultaneous Move Games. NIPS (2013)
Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Michal Pechoucek
Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information. ECAI (2012)
Branislav Bosanský, Ondrej Vanek, Michal Pechoucek
Strategy Representation Analysis for Patrolling Games. AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health (2012)
Viliam Lisý, Radek Píbil, Jan Stiborek, Branislav Bosanský, Michal Pechoucek
Game-theoretic Approach to Adversarial Plan Recognition. ECAI (2012)
Peter Novák, Antonín Komenda, Viliam Lisý, Branislav Bosanský, Michal Cáp, Michal Pechoucek
Tactical operations of multi-robot teams in urban warfare (demonstration). AAMAS (2012)
Ondrej Vanek, Branislav Bosanský, Michal Jakob, Viliam Lisý, Michal Pechoucek
Extending Security Games to Defenders with Constrained Mobility. AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health (2012)
Radek Píbil, Viliam Lisý, Christopher Kiekintveld, Branislav Bosanský, Michal Pechoucek
Game Theoretic Model of Strategic Honeypot Selection in Computer Networks. GameSec (2012)
Ondrej Vanek, Zhengyu Yin, Manish Jain, Branislav Bosanský, Milind Tambe, Michal Pechoucek
Game-theoretic resource allocation for malicious packet detection in computer networks. AAMAS (2012)
Viliam Lisý, Branislav Bosanský, Michal Pechoucek
Anytime algorithms for multi-agent visibility-based pursuit-evasion games. AAMAS (2012)
Branislav Bosanský, Viliam Lisý, Michal Pechoucek
Towards Cooperation in Adversarial Search with Confidentiality. HoloMAS (2011)
Ondrej Vanek, Michal Jakob, Viliam Lisý, Branislav Bosanský, Michal Pechoucek
Iterative game-theoretic route selection for hostile area transit and patrolling. AAMAS (2011)
Michal Jakob, Ondrej Vanek, Branislav Bosanský, Ondrej Hrstka, Michal Pechoucek
AgentC: agent-based system for securing maritime transit. AAMAS (2011)
Branislav Bosanský, Viliam Lisý, Michal Jakob, Michal Pechoucek
Computing time-dependent policies for patrolling games with mobile targets. AAMAS (2011)
Lenka Lhotská, Branislav Bosanský, Jaromir Dolezal
Integration of Procedural Knowledge in Multi-Agent Systems in Medicine. ITBAM (2011)
Viliam Lisý, Branislav Bosanský, Roman Vaculín, Michal Pechoucek
Agent subset adversarial search for complex non-cooperative domains. CIG (2010)
Ondrej Vanek, Branislav Bosanský, Michal Jakob, Michal Pechoucek
Transiting areas patrolled by a mobile adversary. CIG (2010)
Viliam Lisý, Branislav Bosanský, Michal Jakob, Michal Pechoucek
Goal-based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic. ICAART (2009)
Viliam Lisý, Branislav Bosanský, Michal Jakob, Michal Pechoucek
Adversarial search with procedural knowledge heuristic. AAMAS (2) (2009)
Viliam Lisý, Branislav Bosanský, Michal Jakob, Michal Pechoucek
Goal-Based Game Tree Search for Complex Domains. ICAART (Revised Selected Papers) (2009)
Branislav Bosanský, Cyril Brom
Agent-Based Simulation of Business Processes in a Virtual World. HAIS (2008)