Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBranislav Bosanský
Branislav Bošanský
Person information
- unicode name: Branislav Bošanský
- affiliation: Czech Technical University in Prague, Department of Computer Science and Engineering
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j9]Karel Horák
, Branislav Bosanský, Vojtech Kovarík, Christopher Kiekintveld:
Solving zero-sum one-sided partially observable stochastic games. Artif. Intell. 316: 103838 (2023)- 2022
- [c62]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: 44-63 - [i12]Tomás Pevný, Viliam Lisý, Branislav Bosanský, Petr Somol, Michal Pechoucek:
Explaining Classifiers Trained on Raw Hierarchical Multiple-Instance Data. CoRR abs/2208.02694 (2022) - [i11]Branislav Bosanský, Dominik Kouba, Ondrej Manhal, Thorsten Sick, Viliam Lisý, Jakub Kroustek, Petr Somol:
Avast-CTU Public CAPE Dataset. CoRR abs/2209.03188 (2022) - 2021
- [c61]Jakub Cerný, Viliam Lisý, Branislav Bosanský, Bo An:
Computing Quantal Stackelberg Equilibrium in Extensive-Form Games. AAAI 2021: 5260-5268 - [c60]Petr Tomásek, Karel Horák, Aditya Aradhye, Branislav Bosanský, Krishnendu Chatterjee:
Solving Partially Observable Stochastic Shortest-Path Games. IJCAI 2021: 4182-4189 - [e1]Branislav Bosanský, Cleotilde Gonzalez, Stefan Rass, Arunesh Sinha:
Decision and Game Theory for Security - 12th International Conference, GameSec 2021, Virtual Event, October 25-27, 2021, Proceedings. Lecture Notes in Computer Science 13061, Springer 2021, ISBN 978-3-030-90369-5 [contents] - [i10]Marek Galovic, Branislav Bosanský, Viliam Lisý:
Improving Robustness of Malware Classifiers using Adversarial Strings Generated from Perturbed Latent Representations. CoRR abs/2110.11987 (2021) - [i9]Aditya Aradhye, Branislav Bosanský, Michael Hlavácek:
Computing Stackelberg Equilibrium with Memory in Sequential Games. CoRR abs/2111.02111 (2021) - 2020
- [j8]Jirí Cermák, Viliam Lisý, Branislav Bosanský:
Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games. Artif. Intell. 282: 103248 (2020) - [c59]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: 1969-1971 - [c58]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: 385-404 - [c57]Jakub Cerný, Viliam Lisý, Branislav Bosanský, Bo An:
Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium. IJCAI 2020: 246-253 - [c56]Jirí Cermák, Viliam Lisý, Branislav Bosanský:
Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract). IJCAI 2020: 5030-5034 - [c55]Jakub Cerný, Branislav Bosanský, Bo An:
Finite State Machines Play Extensive-Form Games. EC 2020: 509-533 - [i8]Olga Petrova, Karel Durkota, Galina Alperovich, Karel Horák, Michal Najman, Branislav Bosanský, Viliam Lisý:
Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection. CoRR abs/2004.10638 (2020) - [i7]Karel Horák, Branislav Bosanský, Vojtech Kovarík, Christopher Kiekintveld:
Solving Zero-Sum One-Sided Partially Observable Stochastic Games. CoRR abs/2010.11243 (2020)
2010 – 2019
- 2019
- [j7]Karel Durkota, Viliam Lisý, Branislav Bosanský, Christopher Kiekintveld, Michal Pechoucek:
Hardening networks against strategic attackers using attack graph games. Comput. Secur. 87 (2019) - [j6]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) - [c54]Karel Horák, Branislav Bosanský:
Solving Partially Observable Stochastic Games with Public Observations. AAAI 2019: 2029-2036 - [c53]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: 394-400 - [c52]Thanh Hong Nguyen, Amulya Yadav, Branislav Bosanský, Yu Liang:
Tackling Sequential Attacks in Security Games. GameSec 2019: 331-351 - [c51]Xinrun Wang, Milind Tambe, Branislav Bosanský, Bo An:
When Players Affect Target Values: Modeling and Solving Dynamic Partially Observable Security Games. GameSec 2019: 542-562 - [c50]Pavel Rytír, Lukás Chrpa, Branislav Bosanský:
Using Classical Planning in Adversarial Problems. ICTAI 2019: 1335-1340 - [c49]Karel Horák, Branislav Bosanský, Christopher Kiekintveld, Charles A. Kamhoua:
Compact Representation of Value Function in Partially Observable Stochastic Games. IJCAI 2019: 350-356 - [i6]Karel Horák, Branislav Bosanský, Christopher Kiekintveld, Charles A. Kamhoua:
Compact Representation of Value Function in Partially Observable Stochastic Games. CoRR abs/1903.05511 (2019) - 2018
- [j5]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: 290-326 (2018) - [c48]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: 623-636 - [c47]Karel Horák, Branislav Bosanský, Krishnendu Chatterjee:
Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs. IJCAI 2018: 4764-4770 - [c46]Jakub Cerný, Branislav Bosanský, Christopher Kiekintveld:
Incremental Strategy Generation for Stackelberg Equilibria in Extensive-Form Games. EC 2018: 151-168 - [i5]Jiri Cermak, Viliam Lisý, Branislav Bosanský:
Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games. CoRR abs/1803.05392 (2018) - 2017
- [j4]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): 23:1-23:24 (2017) - [c45]Jiri Cermak, Branislav Bosanský:
Towards Solving Imperfect Recall Games. AAAI Workshops 2017 - [c44]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 - [c43]Qingyu Guo, Bo An, Branislav Bosanský, Christopher Kiekintveld:
Strategic Information Revelation and Commitment in Security Games. AAAI Workshops 2017 - [c42]Karel Horák, Branislav Bosanský, Michal Pechoucek:
Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games. AAAI 2017: 558-564 - [c41]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: 902-910 - [c40]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: 171-192 - [c39]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: 273-294 - [c38]Branislav Bosanský, Jiri Cermak, Karel Horák, Michal Pechoucek:
Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall. ICAART (2) 2017: 63-74 - [c37]Karel Horák, Branislav Bosanský:
Dynamic Programming for One-sided Partially Observable Pursuit-evasion Games. ICAART (2) 2017: 503-510 - [c36]Jiri Cermak, Branislav Bosanský, Viliam Lisý:
An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games. IJCAI 2017: 936-942 - [c35]Qingyu Guo, Bo An, Branislav Bosanský, Christopher Kiekintveld:
Comparing Strategic Secrecy and Stackelberg Commitment in Security Games. IJCAI 2017: 3691-3699 - 2016
- [j3]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: 1-40 (2016) - [j2]Karel Durkota, Viliam Lisý, Christopher Kiekintveld, Branislav Bosanský, Michal Pechoucek:
Case Studies of Network Defense with Attack Graph Games. IEEE Intell. Syst. 31(5): 24-30 (2016) - [c34]Jiri Cermak, Branislav Bosanský, Karel Durkota, Viliam Lisý, Christopher Kiekintveld:
Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games. AAAI 2016: 439-445 - [c33]Karel Horák, Branislav Bosanský:
A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games. GameSec 2016: 435-454 - [i4]Karel Horák, Branislav Bosanský:
Dynamic Programming for One-Sided Partially Observable Pursuit-Evasion Games. CoRR abs/1606.06271 (2016) - [i3]Branislav Bosanský, Jiri Cermak, Karel Horák, Michal Pechoucek:
Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall. CoRR abs/1608.01510 (2016) - 2015
- [c32]Branislav Bosanský, Jiri Cermak:
Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games. AAAI 2015: 805-811 - [c31]Branislav Bosanský, Albert Xin Jiang, Milind Tambe, Christopher Kiekintveld:
Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies. AAAI 2015: 812-818 - [c30]Karel Durkota, Viliam Lisý, Christopher Kiekintveld, Branislav Bosanský:
Game-Theoretic Algorithms for Optimal Network Security Hardening Using Attack Graphs. AAMAS 2015: 1773-1774 - [c29]Jirí Cermák, Branislav Bosanský, Nicola Gatti:
Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games. AAMAS 2015: 1813-1814 - [c28]Karel Durkota, Viliam Lisý, Branislav Bosanský, Christopher Kiekintveld:
Approximate Solutions for Attack Graph Games with Imperfect Information. GameSec 2015: 228-249 - [c27]Karel Durkota, Viliam Lisý, Branislav Bosanský, Christopher Kiekintveld:
Optimal Network Security Hardening Using Attack Graph Games. IJCAI 2015: 526-532 - [c26]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: 201-215 - [i2]Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Computation of Stackelberg Equilibria of Finite Sequential Games. CoRR abs/1507.07677 (2015) - 2014
- [j1]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: 829-866 (2014) - [c25]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: 1617-1618 - [c24]Jirí Cermák, Branislav Bosanský, Viliam Lisý:
Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games. ECAI 2014: 201-206 - 2013
- [c23]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: 335-342 - [c22]Branislav Bosanský:
Solving extensive-form games with double-oracle methods. AAMAS 2013: 1423-1424 - [c21]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: 48-54 - [c20]Viliam Lisý, Vojtech Kovarík, Marc Lanctot, Branislav Bosanský:
Convergence of Monte Carlo Tree Search in Simultaneous Move Games. NIPS 2013: 2112-2120 - [i1]Viliam Lisý, Vojtech Kovarík, Marc Lanctot, Branislav Bosanský:
Convergence of Monte Carlo Tree Search in Simultaneous Move Games. CoRR abs/1310.8613 (2013) - 2012
- [c19]Branislav Bosanský, Ondrej Vanek, Michal Pechoucek:
Strategy Representation Analysis for Patrolling Games. AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health 2012 - [c18]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 - [c17]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: 905-912 - [c16]Viliam Lisý, Branislav Bosanský, Michal Pechoucek:
Anytime algorithms for multi-agent visibility-based pursuit-evasion games. AAMAS 2012: 1301-1302 - [c15]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: 1473-1474 - [c14]Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Michal Pechoucek:
Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information. ECAI 2012: 193-198 - [c13]Viliam Lisý, Radek Píbil, Jan Stiborek, Branislav Bosanský, Michal Pechoucek:
Game-theoretic Approach to Adversarial Plan Recognition. ECAI 2012: 546-551 - [c12]Radek Píbil, Viliam Lisý, Christopher Kiekintveld, Branislav Bosanský, Michal Pechoucek:
Game Theoretic Model of Strategic Honeypot Selection in Computer Networks. GameSec 2012: 201-220 - 2011
- [c11]Branislav Bosanský, Viliam Lisý, Michal Jakob, Michal Pechoucek:
Computing time-dependent policies for patrolling games with mobile targets. AAMAS 2011: 989-996 - [c10]Ondrej Vanek, Michal Jakob, Viliam Lisý, Branislav Bosanský, Michal Pechoucek:
Iterative game-theoretic route selection for hostile area transit and patrolling. AAMAS 2011: 1273-1274 - [c9]Michal Jakob, Ondrej Vanek, Branislav Bosanský, Ondrej Hrstka, Michal Pechoucek:
AgentC: agent-based system for securing maritime transit. AAMAS 2011: 1309-1310 - [c8]Branislav Bosanský, Viliam Lisý, Michal Pechoucek:
Towards Cooperation in Adversarial Search with Confidentiality. HoloMAS 2011: 246-255 - [c7]Lenka Lhotská, Branislav Bosanský, Jaromir Dolezal:
Integration of Procedural Knowledge in Multi-Agent Systems in Medicine. ITBAM 2011: 82-95 - 2010
- [c6]Ondrej Vanek, Branislav Bosanský, Michal Jakob, Michal Pechoucek:
Transiting areas patrolled by a mobile adversary. CIG 2010: 9-16 - [c5]Viliam Lisý, Branislav Bosanský, Roman Vaculín, Michal Pechoucek:
Agent subset adversarial search for complex non-cooperative domains. CIG 2010: 211-218
2000 – 2009
- 2009
- [c4]Viliam Lisý, Branislav Bosanský, Michal Jakob, Michal Pechoucek:
Adversarial search with procedural knowledge heuristic. AAMAS (2) 2009: 899-906 - [c3]Viliam Lisý, Branislav Bosanský, Michal Jakob, Michal Pechoucek:
Goal-based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic. ICAART 2009: 53-60 - [c2]Viliam Lisý, Branislav Bosanský, Michal Jakob, Michal Pechoucek:
Goal-Based Game Tree Search for Complex Domains. ICAART (Revised Selected Papers) 2009: 97-109 - 2008
- [c1]Branislav Bosanský, Cyril Brom:
Agent-Based Simulation of Business Processes in a Virtual World. HAIS 2008: 86-94
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-03-30 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
