People

RESEARCHERS & LECTURERS

DOC. MGR. BRANISLAV BOŠANSKÝ, PH.D.

doc. Mgr. Branislav Bošanský, Ph.D.
Praha 2, Karlovo náměstí 13, E-407
+420 224 357 581
bosanbra@fel.cvut.cz | branislav.bosansky@agents.fel.cvut.cz

Theses topics
  • Game Theory:
    • Sequential Games
    • Dynamic Games
    • Stackelberg Equilibrium
    • Equilibrium Computation

Čermák, J., Bošanský, B., Horák, K., Lisý, V., Pěchouček, M. 2018 Approximating Maxmin Strategies in Imperfect Recall Games Using A-loss Recall Property, detail

Horák, K., Bošanský, B., Chatterjee, K. 2018 Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs, detail

Černý, J., Bošanský, B., Kiekintveld, C. 2018 Incremental Strategy Generation for Stackelberg Equilibria in Extensive-Form Games, detail

Basak, A., Černý, J., Gutierrez, M., Curtis, S., Kamhoua, C., Jones, D., Bošanský, B., Kiekintveld, C. 2018 An Initial Study of Targeted Personality Models in the FlipIt Game, detail

Bošanský, B., Kretinsky, J., Brazdil, T. 2018 Game Solving: Theory and Practice, detail

Bošanský, B. 2018 Game Theory for Cyber Deception, detail

Horák, K., Zhu, Q., Bošanský, B. 2017 Manipulating Adversary’s Belief: A Dynamic Game Approach to Deception by Design for Proactive Network Security, detail

Durkota, K., Lisý, V., Kiekintveld, C., Horák, K., Bošanský, B., Pevný, T. 2017 Optimal Strategies for Detecting Data Exfiltration by Internal and External Attackers, detail

Horák, K., Bošanský, B., Pěchouček, M. 2017 Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games, detail

Čermák, J., Bošanský, B. 2017 Towards Solving Imperfect Recall Games, detail

Qingyu, G., An, B., Bošanský, B., Kiekintveld, C. 2017 Comparing Strategic Secrecy and Stackelberg Commitment in Security Games, detail

Bošanský, B., Branzei, S., Hansen, K.A., Lund, T.B., Miltersen, P.B. 2017 Computation of Stackelberg Equilibria of Finite Sequential Games, detail

Bošanský, B., Čermák, J., Horák, K., Pěchouček, M. 2017 Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall, detail

Čermák, J., Bošanský, B., Pěchouček, M. 2017 Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games, detail

Horák, K., Bošanský, B. 2017 Dynamic Programming for One-sided Partially Observable Pursuit-evasion Games, detail

Bošanský, B., Čermák, J., Horák, K., Pěchouček, M. 2017 Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall, detail

Čermák, J., Bošanský, B., Lisý, V. 2017 An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games, detail

Čermák, J., Bošanský, B., Pěchouček, M. 2017 Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games, detail

Bošanský, B., Lisý, V., Lanctot, M., Čermák, J., Winands, M. H. M. 2016 Algorithms for computing strategies in two-player simultaneous move games, detail

Kiekintveld, C., Durkota, K., Durkota, K., Lisý, V., 2Pěchouček, M., Bošanský, B. 2016 Case Studies of Network Defense with Attack Graph Games, detail

Horák, K., Bošanský, B. 2016 A Point-Based Approximate Algorithm for One-Side Partially Observable Pursuit-Evasion Games, detail

Čermák, J., Bošanský, B., Durkota, K., Lisý, V., Kiekintveld, C. 2016 Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-form Games, detail

Durkota, K., Lisý, V., Kiekintveld, C., Bošanský, B., Pěchouček, M. 2016 Case Studies of Network Defense with Attack Graph Games, detail

Durkota, K., Lisý, V., Horák, K., Kiekintveld, Ch., Bošanský, B., Pevný, T. 2016 Game-theoretic Analysis of Detecting Data Exfiltration, detail

Čermák, J., Bošanský, B., Gatti, N. 2015 Effectiveness of Game-Theoretic Strategies in Extensive-Form General-Sum Games, detail

Bošanský, B., Jiang, AX, Tambe, M., Kiekintveld, C D 2015 Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies, detail

Bošanský, B., Čermák, J. 2015 Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games, detail

Bošanský, B., Branzei, S., Hansen, KA, Miltersen, PB, Sorensen, TB 2015 Computation of Stackelberg Equilibria of Finite Sequential Games, detail

Durkota, K., Lisý, V., Kiekintveld, K., Bošanský, B. 2015 Game-Theoretic Algorithms for Optimal Network Security Hardening Using Attack Graphs, detail

Durkota, K., Lisý, V., Bošanský, B., Kiekintveld, K. 2015 Optimal Network Security Hardening Using Attack Graph Games, detail

Durkota, K., Lisý, V., Bošanský, B., Kiekintveld, K. 2015 Approximate Solutions for Attack Graph Games with Imperfect Information, detail

Čermák, J., Bošanský, B., Gatti, N. 2015 Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games, detail

Čermák, J., Bošanský, B., Lisý, V. 2014 Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games, detail

Abaffy, M., Brázdil, T., Řehák, V., Bošanský, B., Kučera, A., Krčál, J. 2014 Solving adversarial patrolling games with bounded error, detail

Bošanský, B., Kiekintveld, C., Lisý, V., Pěchouček, M. 2014 An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information, detail

Lhotská, L., Doležal, J., Bošanský, B. 2013 Knowledge-Based Support of Medical Work in Home Care, detail

Lisý, V., Kovařík, V., Lanctot, M., Bošanský, B. 2013 Convergence of Monte Carlo Tree Search in Simultaneous Move Games, detail

Bošanský, B., Lisý, V., Čermák, J., Vítek, R., Pěchouček, M. 2013 Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games, detail

Bošanský, B., Kiekintveld, C., Lisý, V., Čermák, J., Pěchouček, M. 2013 Double-Oracle Algorithm for Computing an Exact Nash Equilibrium in Zero-Sum Extensive-Form Games, detail

Bošanský, B. 2013 Solving Extensive-Form Games with Double-Oracle Methods, detail

Bošanský, B., Kiekintveld, C., Lisý, V., Pěchouček, M. 2012 Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information, detail

Lisý, V., Bošanský, B., Pěchouček, M. 2012 Anytime Algorithms for Multi-agent Visibility-based Pursuit-evasion Games, detail

Lisý, V., Píbil, R., Stiborek, J., Bošanský, B., Pěchouček, M. 2012 Game-theoretic Approach to Adversarial Plan Recognition, detail

Novák, P., Komenda, A., Lisý, V., Bošanský, B., Čáp, M., Pěchouček, M. 2012 Tactical Operations of Multi-Robot Teams in Urban Warfare (Demonstration), detail

Vaněk, O., Yin, Z., Jain, M., Bošanský, B., Tambe, M., Pěchouček, M. 2012 Game-theoretic Resource Allocation for Malicious Packet Detection in Computer Networks, detail

Vaněk, O., Bošanský, B., Jakob, M., Lisý, V., Pěchouček, M. 2012 Extending Security Games to Defenders with Constrained Mobility, detail

Bošanský, B., Vaněk, O., Pěchouček, M. 2012 Strategy Representation Analysis for Patrolling Games, detail

Píbil, R., Lisý, V., Kiekintveld, C. D., Bošanský, B., Pěchouček, M. 2012 Game Theoretic Model of Strategic Honeypot Selection in Computer Networks, detail

Bošanský, B. 2011 Process-based Multi-agent Architecture in Home Care, detail

Bošanský, B., Čáp, M., Komenda, A., Lisý, V., Novák, P., Pěchouček, M. 2011 Deliberative and Reactive Planning in Adversarial Environments, detail

Lhotská, L., Bošanský, B., Doležal, J. 2011 Integration of Procedural Knowledge in Multi-Agent Systems in Medicine, detail

Vaněk, O., Jakob, M., Lisý, V., Bošanský, B., Pěchouček, M. 2011 Iterative Game-theoretic Route Selection for Hostile Area Transit and Patrolling, detail

Vaněk, O., Pěchouček, M., Jakob, M., Bošanský, B., Lisý, V. 2011 Agentni simulaci proti somalskym piratum, detail

Jakob, M., Vaněk, O., Bošanský, B., Hrstka, O., Pěchouček, M. 2011 AgentC: Agent-based System for Securing Maritime Transit (Demonstration), detail

Bošanský, B., Lisý, V., Jakob, M., Pěchouček, M. 2011 Computing Time-Dependent Policies for Patrolling Games with Mobile Targets, detail

Bošanský, B., Lisý, V., Pěchouček, M. 2011 Towards Cooperation in Adversarial Search with Confidentiality, detail

Lisý, V., Bošanský, B., Jakob, M., Pěchouček, M. 2010 Goal-Based Game Tree Search for Complex Domains, detail

Vaněk, O., Bošanský, B., Jakob, M., Pěchouček, M. 2010 Transiting Areas Patrolled by a Mobile Adversary, detail

Lisý, V., Bošanský, B., Vaculín, R., Pěchouček, M. 2010 Agent Subset Adversarial Search for Complex Non-cooperative Domains, detail

Jakob, M., Vaněk, O., Bošanský, B., Hrstka, O., Pěchouček, M. 2010 Adversarial Modeling and Reasoning in the Maritime Domain, Year 2 Report, detail

Lisý, V., Bošanský, B., Jakob, M., Pěchouček, M. 2009 Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic, detail

Lisý, V., Bošanský, B., Jakob, M., Pěchouček, M. 2009 Adversarial Search with Procedural Knowledge Heuristic, detail

Semsch, E., Lisý, V., Bošanský, B., Jakob, M., Pavlíček, D., Doubek, J., Pěchouček, M. 2009 Adversarial Behavior Testbed, detail