Branislav Bosanský

Orcid: 0000-0002-3841-9515

Affiliations:
  • Czech Technical University in Prague, Department of Computer Science and Engineering


According to our database1, Branislav Bosanský authored at least 77 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Iterative algorithms for solving one-sided partially observable stochastic shortest path games.
Int. J. Approx. Reason., 2024

Counteracting Concept Drift by Learning with Future Malware Predictions.
CoRR, 2024

How to Train your Antivirus: RL-based Hardening through the Problem Space.
Proceedings of the 27th International Symposium on Research in Attacks, 2024

2023
Solving zero-sum one-sided partially observable stochastic games.
Artif. Intell., March, 2023

2022
Avast-CTU Public CAPE Dataset.
CoRR, 2022

Explaining Classifiers Trained on Raw Hierarchical Multiple-Instance Data.
CoRR, 2022

Cyber Deception Against Zero-Day Attacks: A Game Theoretic Approach.
Proceedings of the Decision and Game Theory for Security - 13th International Conference, 2022

2021
Computing Stackelberg Equilibrium with Memory in Sequential Games.
CoRR, 2021

Improving Robustness of Malware Classifiers using Adversarial Strings Generated from Perturbed Latent Representations.
CoRR, 2021

Solving Partially Observable Stochastic Shortest-Path Games.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Computing Quantal Stackelberg Equilibrium in Extensive-Form Games.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games.
Artif. Intell., 2020

Finite State Machines Play Extensive-Form Games.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Using One-Sided Partially Observable Stochastic Games for Solving Zero-Sum Security Games with Sequential Attacks.
Proceedings of the Decision and Game Theory for Security - 11th International Conference, 2020

Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Optimizing honeypot strategies against dynamic lateral movement using partially observable stochastic games.
Comput. Secur., 2019

Hardening networks against strategic attackers using attack graph games.
Comput. Secur., 2019

Compact Representation of Value Function in Partially Observable Stochastic Games.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Using Classical Planning in Adversarial Problems.
Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019

When Players Affect Target Values: Modeling and Solving Dynamic Partially Observable Security Games.
Proceedings of the Decision and Game Theory for Security - 10th International Conference, 2019

Tackling Sequential Attacks in Security Games.
Proceedings of the Decision and Game Theory for Security - 10th International Conference, 2019

Evaluating Models of Human Behavior in an Adversarial Multi-Armed Bandit Problem.
Proceedings of the 41th Annual Meeting of the Cognitive Science Society, 2019

Solving Partially Observable Stochastic Games with Public Observations.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Approximating maxmin strategies in imperfect recall games using A-loss recall property.
Int. J. Approx. Reason., 2018

Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games.
CoRR, 2018

Incremental Strategy Generation for Stackelberg Equilibria in Extensive-Form Games.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

An Initial Study of Targeted Personality Models in the FlipIt Game.
Proceedings of the Decision and Game Theory for Security - 9th International Conference, 2018

2017
Computation of Stackelberg Equilibria of Finite Sequential Games.
ACM Trans. Economics and Comput., 2017

Comparing Strategic Secrecy and Stackelberg Commitment in Security Games.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Dynamic Programming for One-sided Partially Observable Pursuit-evasion Games.
Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall.
Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

Manipulating Adversary's Belief: A Dynamic Game Approach to Deception by Design for Proactive Network Security.
Proceedings of the Decision and Game Theory for Security - 8th International Conference, 2017

Optimal Strategies for Detecting Data Exfiltration by Internal and External Attackers.
Proceedings of the Decision and Game Theory for Security - 8th International Conference, 2017

Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Strategic Information Revelation and Commitment in Security Games.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Towards Solving Imperfect Recall Games.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Case Studies of Network Defense with Attack Graph Games.
IEEE Intell. Syst., 2016

Algorithms for computing strategies in two-player simultaneous move games.
Artif. Intell., 2016

A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games.
Proceedings of the Decision and Game Theory for Security - 7th International Conference, 2016

Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Optimal Network Security Hardening Using Attack Graph Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Approximate Solutions for Attack Graph Games with Imperfect Information.
Proceedings of the Decision and Game Theory for Security - 6th International Conference, 2015

Game-Theoretic Algorithms for Optimal Network Security Hardening Using Attack Graphs.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information.
J. Artif. Intell. Res., 2014

Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Solving adversarial patrolling games with bounded error: (extended abstract).
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Convergence of Monte Carlo Tree Search in Simultaneous Move Games.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games.
Proceedings of the IJCAI 2013, 2013

Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Solving extensive-form games with double-oracle methods.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Game Theoretic Model of Strategic Honeypot Selection in Computer Networks.
Proceedings of the Decision and Game Theory for Security - Third International Conference, 2012

Game-theoretic Approach to Adversarial Plan Recognition.
Proceedings of the ECAI 2012, 2012

Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information.
Proceedings of the ECAI 2012, 2012

Game-theoretic resource allocation for malicious packet detection in computer networks.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Tactical operations of multi-robot teams in urban warfare (demonstration).
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Anytime algorithms for multi-agent visibility-based pursuit-evasion games.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Extending Security Games to Defenders with Constrained Mobility.
Proceedings of the Game Theory for Security, 2012

Strategy Representation Analysis for Patrolling Games.
Proceedings of the Game Theory for Security, 2012

2011
Integration of Procedural Knowledge in Multi-Agent Systems in Medicine.
Proceedings of the Information Technology in Bio- and Medical Informatics, 2011

Towards Cooperation in Adversarial Search with Confidentiality.
Proceedings of the Holonic and Multi-Agent Systems for Manufacturing, 2011

Iterative game-theoretic route selection for hostile area transit and patrolling.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

AgentC: agent-based system for securing maritime transit.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Computing time-dependent policies for patrolling games with mobile targets.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
Transiting areas patrolled by a mobile adversary.
Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, 2010

Agent subset adversarial search for complex non-cooperative domains.
Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, 2010

2009
Goal-Based Game Tree Search for Complex Domains.
Proceedings of the Agents and Artificial Intelligence - International Conference, 2009

Goal-based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic.
Proceedings of the ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19, 2009

Adversarial search with procedural knowledge heuristic.
Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
Agent-Based Simulation of Business Processes in a Virtual World.
Proceedings of the Hybrid Artificial Intelligence Systems, Third International Workshop, 2008


  Loading...