Branislav Bosansky

Current Affiliation

  • Assistant Professor at Department of Computer Science, Faculty of Electrical Engineering, Czech Technical University in Prague
    • bosansky at fel.cvut.cz
  • Senior Research Scientist at Avast Software
    • branislav dot bosansky at avast.com
  • CV

Current Research Topics and Interests

  • algorithmic and computational game theory, extensive-form games, stochastic games, computing Stackelberg equilibria

Materials

  • GameSec 2018 tutorial on Algorithms for Solving Dynamic Games with Imperfect Information PDF

Selected publications

  • working papers and topics
    • Equilibrium Computation in (Partially Observable) Dynamic Stochastic Games
  • 2020
    • Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games
      • J. Cermak, V. Lisy, B. Bosansky, Artificial Intelligence (link), extended abstract @ IJCAI 2020, PDF
    • Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium
      • J. Cerny, V. Lisy, B. Bosansky, B. An, IJCAI 2020, PDF
    • Finite State Machines Play Extensive-Form Games
      • J. Cerny, B. Bosansky, B. An, EC 2020, PDF
    • Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection
      • O. Petrova, K. Durkota, G. Alperovich, K. Horak, M. Najman, B. Bosansky, V. Lisy, extended abstract @AAMAS 2020, full version
  • 2019
    • Tackling Sequential Attacks in Security Games
      • T. Nguyen, A. Yadav, B. Bosansky and Y. Liang, GameSec 2019
    • Hardening Networks Against Strategic Attackers Using Attack Graph Games
      • K. Durkota, V. Lisy, B. Bosansky, C. Kiekintveld, M. Pechoucek, Computers & Security, 2019
    • Optimizing Honeypot Strategies Against Dynamic Lateral Movement Using Partially Observable Stochastic Games
      • K. Horak, B. Bosansky, P. Tomasek, C. Kiekintveld, C. Kamhoua, Computers & Security, 2019
    • Compact Representation of Value Function in Partially Observable Stochastic Games
      • K. Horak, B. Bosansky, C. Kiekintveld, C. Kamhoua, IJCAI 2019, PDF
    • Solving Partially Observable Stochastic Games with Public Observations.
      • K. Horak, B. Bosansky, AAAI Conference on Artificial Intelligence, 2019, PDF
    • When Players Affect Target Values: Modeling and Solving Dynamic Partially Observable Security Games
      • X. Wang, M. Tambe, B. Bosansky, B. An, OptMAS workshop @AAMAS 2019, GameSec 2019 PDF
    • Evaluating Models of Human Behavior in an Adversarial Multi-Armed Bandit Problem
      • M. Gutierrez, J. Černý, N. Ben-Asher, E. Aharonov, A. Basak, B. Bošanský, C. Kiekintveld, and C. Gonzalez, CogSci 2019, OptMAS workshop @AAMAS 2019, PDF
  • 2018
    • Approximating maxmin strategies in imperfect recall games using A-loss recall property
      • J. Cermak, B. Bosansky, K. Horak, V. Lisy, M. Pechoucek, International Journal of Approximate Reasoning, 2018, link
    • Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games
      • J. Cermak, V. Lisy, B. Bosansky, under review, 2018, PDF
    • Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs
      • K. Horak, B. Bosansky, K. Chatterjee, IJCAI 2018,
    • Incremental Strategy Generation for Stackelberg Equilibria in Extensive-Form Games
      • J. Cerny, B. Bosansky, C. Kiekintveld, EC 2018,
  • 2017
    • Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games
      • K. Horak, B. Bosansky, M. Pechoucek. AAAI 2017, PDF
    • Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games
      • J. Cermak, B. Bosansky, M. Pechoucek. AAMAS 2017, PDF
    • An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games
      • J. Cermak, B. Bosansky, V. Lisy. IJCAI 2017, PDF
    • Comparing Strategic Secrecy and Stackelberg Commitment in Security Games
      • Q. Guo, B. An, B. Bosansky, C. Kiekintveld. IJCAI 2017, PDF
    • Computation of Stackelberg Equilibria of Finite Sequential Games
      • B. Bosansky, S. Branzei, K. A. Hansen, T. B. Lund, P. B. Miltersen; ACM TEAC 2017; PDF
    • Manipulating Adversary’s Belief: A Dynamic Game Approach to Deception by Design for Proactive Network Security
      • K. Horak, Q. Zhu, B. Bosansky ; GameSec 2017; PDF
    • Computation of Stackelberg Equilibria of Finite Sequential Games
      • K Durkota, V Lisy, C Kiekintveld, K Horak, B Bosansky, T Pevny; GameSec 2017; PDF
  • 2016
    • Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games
      • J. Cermak, B. Bosansky, K. Durkota, V. Lisy, C. Kiekintveld; AAAI 2016, PDF
    • Algorithms for Computing Strategies in Two-Player Simultaneous Move Games
      • B.Bosansky, V. Lisy, M. Lanctot, J. Cermak, M. Winands; Artificial Intelligence (AIJ) 2016; link
    • A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games
      • K. Horak, B.Bosansky, GameSec 2016, PDF
    • Case Studies of Network Defense with Attack Graph Games
      • K. Durkota, V. Lisy, C. Kiekintveld, B. Bosansky, M. Pechoucek; IEEE Intelligent Systems; 2016
  • 2015
    • Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies
      • B. Bosansky, A.X. Jiang, M. Tambe, C. Kiekintveld; AAAI 2015; PDF
    • Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games
      • B. Bosansky, J. Cermak; AAAI 2015; PDF
    • Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games (Extended Abstract)
    • Game-Theoretic Algorithms for Optimal Network Security Hardening Using Attack Graphs (Extended Abstract)
    • Optimal Network Security Hardening Using Attack Graph Games
      • K. Durkota, V. Lisy, B. Bosansky, C. Kiekintveld; IJCAI 2015; PDF
    • Approximate Solutions for Attack Graph Games with Imperfect Information
      • K. Durkota, V. Lisy, B. Bosansky, C. Kiekintveld; GameSec 2015
    • Computation of Stackelberg Equilibria of Finite Sequential Games
      • B. Bosansky, S. Branzei, K. A. Hansen, P. B. Miltersen, T. B. Sørensen; WINE 2015; PDF
  • 2014
    • Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games
      • J. Cermak, B. Bosansky, V. Lisy; ECAI 2014; PDF
    • 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 (JAIR) 2014; PDF
    • Solving Adversarial Patrolling Games With Bounded Error (Extended Abstract)
      • M. Abaffy, T. Brazdil, V. Rehak, B. Bosansky, A. Kucera, J. Krcal; AAMAS 2014; PDF
    • Iterative Algorithms for Solving Finite Sequential Zero-Sum Games
      • B. Bosansky; PhD thesis, 2014; PDF
  • 2013
    • Using Double-oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Moves Games
      • B. Bosansky, V. Lisy, J. Cermak, R. Vitek, M. Pechoucek; IJCAI 2013; PDF
    • 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; AAMAS 2013; PDF
    • Solving Extensive-form Games with Double-oracle Methods (Extended Abstract)
      • B. Bosansky; AAMAS 2013; PDF
    • Convergence of Monte Carlo Tree Search in Simultaneous Move Games
      • V. Lisy, V. Kovarik, M. Lanctot, B. Bosansky; NIPS 2013; PDF
  • 2012
    • Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks
      • O. Vanek, Z. Yin, M. Jain, B. Bosansky, M. Tambe, M. Pechoucek; AAMAS 2012; PDF
    • Tactical Operations of Multi-Robot Teams in Urban Warfare (Demonstration)
      • P. Novak, A. Komenda, V. Lisy, B. Bosansky, M. Cap, M. Pechoucek; AAMAS 2012; PDF
    • Anytime Algorithms for Multi-agent Visibility-based Pursuit-evasion Games (Extended Abstract)
      • V. Lisy, B. Bosansky, M. Pechoucek; AAMAS 2012; PDF
    • Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information
      • B. Bosansky, C. Kiekintveld, V. Lisy, M. Pechoucek; ECAI 2012; PDF
    • Game-theoretic Approach to Adversarial Plan Recognition
      • V. Lisy, R. Pibil, J. Stiborek, B. Bosansky, M. Pechoucek; ECAI 2012; PDF
    • Extending Security Games to Defenders with Constrained Mobility
      • O. Vanek, B. Bosansky, M. Jakob, V. Lisy, M. Pechoucek; AAAI Symposium on GTSSH 2012; PDF
    • Strategy Representation Analysis for Patrolling Games
      • B. Bosansky, O. Vanek, M. Pechoucek; AAAI Symposium on GTSSH 2012; PDF
    • Game Theoretic Model of Strategic Honeypot Selection in Computer Networks
      • R. Pibil, V. Lisy, C. Kiekintveld, B. Bosansky; GameSec 2012; PDF
  • 2011
    • AgentC: Agent-Based System for Securing Maritime Transit (Demonstration)
      • O. Vanek, M. Jakob, B. Bosansky, O. Hrstka, M. Pechoucek; AAMAS 2011; PDF
    • Iterative Game-Theoretic Route Selection for Hostile area Transit and Patrolling (Extended Abstract)
      • O. Vanek, M. Jakob, V. Lisy, B. Bosansky, M. Pechoucek; AAMAS 2011; PDF
    • Computing Time-Dependent Policies for Patrolling Games with Mobile Targets
      • B. Bosansky, V. Lisy, M. Jakob, M. Pechoucek; AAMAS 2011; PDF
  • older
    • Transiting Areas Patrolled by a Mobile Adversary
      • O. Vanek, B. Bosansky, M. Jakob, M. Pechoucek; CIG 2010; PDF
    • Agent Subset Adversarial Search for Complex Non-cooperative Domains
      • V. Lisy, B. Bosansky, R. Vaculin, M. Pechoucek; CIG 2010; PDF
    • Adversarial Search with Procedural Knowledge Heuristic
      • V. Lisy, B. Bosansky, M. Jakob, M. Pechoucek; AAMAS 2009; PDF