Iterative algorithms for solving one-sided partially observable stochastic shortest path games.

Branislav Bosanský Branislav Bošanský Czech Technical University in Prague, Department of Computer Science and Engineering http://cs.felk.cvut.cz/en/people/bosanbra https://orcid.org/0000-0002-3841-9515 https://www.wikidata.org/entity/Q131118750

Petr Tomásek Karel Horák 0002 Branislav Bosanský Iterative algorithms for solving one-sided partially observable stochastic shortest path games. 109297 2024 175 Int. J. Approx. Reason. https://doi.org/10.1016/j.ijar.2024.109297 db/journals/ijar/ijar175.html#TomasekHB24 streams/journals/ijar

Ilias Tsingenopoulos Jacopo Cortellazzi Branislav Bosanský Simone Aonzo Davy Preuveneers Wouter Joosen Fabio Pierazzi Lorenzo Cavallaro How to Train your Antivirus: RL-based Hardening through the Problem Space. 130-146 2024 RAID https://doi.org/10.1145/3678890.3678912 https://www.wikidata.org/entity/Q131118751 conf/raid/2024 db/conf/raid/raid2024.html#TsingenopoulosC24

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. 2024 abs/2402.19027 CoRR https://doi.org/10.48550/arXiv.2402.19027 db/journals/corr/corr2402.html#abs-2402-19027

Branislav Bosanský Lada Hospodkova Michal Najman Maria Rigaki Elnaz Babayeva Viliam Lisý Counteracting Concept Drift by Learning with Future Malware Predictions. 2024 abs/2404.09352 CoRR https://doi.org/10.48550/arXiv.2404.09352 db/journals/corr/corr2404.html#abs-2404-09352

Karel Horák 0002 Branislav Bosanský Vojtech Kovarík Christopher Kiekintveld Solving zero-sum one-sided partially observable stochastic games. 103838 2023 March 316 Artif. Intell. https://doi.org/10.1016/j.artint.2022.103838 db/journals/ai/ai316.html#HorakBKK23

Md. Abu Sayed Ahmed H. Anwar Christopher Kiekintveld Branislav Bosanský Charles A. Kamhoua Cyber Deception against Zero-day Attacks: A Game Theoretic Approach. 2023 abs/2307.13107 CoRR https://doi.org/10.48550/arXiv.2307.13107 db/journals/corr/corr2307.html#abs-2307-13107

Md. Abu Sayed Ahmed H. Anwar Christopher Kiekintveld Branislav Bosanský Charles A. Kamhoua Cyber Deception Against Zero-Day Attacks: A Game Theoretic Approach. 44-63 2022 GameSec https://doi.org/10.1007/978-3-031-26369-9_3 conf/gamesec/2022 db/conf/gamesec/gamesec2022.html#SayedAKBK22

Tomás Pevný Viliam Lisý Branislav Bosanský Petr Somol Michal Pechoucek Explaining Classifiers Trained on Raw Hierarchical Multiple-Instance Data. 2022 abs/2208.02694 CoRR https://doi.org/10.48550/arXiv.2208.02694 db/journals/corr/corr2208.html#abs-2208-02694

Branislav Bosanský Dominik Kouba Ondrej Manhal Thorsten Sick Viliam Lisý Jakub Kroustek Petr Somol Avast-CTU Public CAPE Dataset. 2022 abs/2209.03188 CoRR https://doi.org/10.48550/arXiv.2209.03188 db/journals/corr/corr2209.html#abs-2209-03188

Jakub Cerný Viliam Lisý Branislav Bosanský Bo An 0001 Computing Quantal Stackelberg Equilibrium in Extensive-Form Games. 5260-5268 2021 AAAI https://doi.org/10.1609/aaai.v35i6.16664 conf/aaai/2021 db/conf/aaai/aaai2021.html#CernyLB021 Petr Tomásek Karel Horák 0002 Aditya Aradhye Branislav Bosanský Krishnendu Chatterjee Solving Partially Observable Stochastic Shortest-Path Games. 4182-4189 2021 IJCAI https://doi.org/10.24963/ijcai.2021/575 conf/ijcai/2021 db/conf/ijcai/ijcai2021.html#TomasekHABC21 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 GameSec Springer 2021 Lecture Notes in Computer Science 13061 978-3-030-90369-5 978-3-030-90370-1 https://doi.org/10.1007/978-3-030-90370-1 db/conf/gamesec/gamesec2021.html

Marek Galovic Branislav Bosanský Viliam Lisý Improving Robustness of Malware Classifiers using Adversarial Strings Generated from Perturbed Latent Representations. 2021 abs/2110.11987 CoRR https://arxiv.org/abs/2110.11987 db/journals/corr/corr2110.html#abs-2110-11987

Aditya Aradhye Branislav Bosanský Michael Hlavácek Computing Stackelberg Equilibrium with Memory in Sequential Games. 2021 abs/2111.02111 CoRR https://arxiv.org/abs/2111.02111 db/journals/corr/corr2111.html#abs-2111-02111

Jirí Cermák Viliam Lisý Branislav Bosanský Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games. 103248 2020 282 Artif. Intell. https://doi.org/10.1016/j.artint.2020.103248 db/journals/ai/ai282.html#CermakLB20

Olga Petrova Karel Durkota Galina Alperovich Karel Horák 0002 Michal Najman Branislav Bosanský Viliam Lisý Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection. 1969-1971 2020 AAMAS https://dl.acm.org/doi/10.5555/3398761.3399044 https://www.ifaamas.org/Proceedings/aamas2020/pdfs/p1969.pdf conf/atal/2020 db/conf/atal/aamas2020.html#PetrovaDAHNBL20 Petr Tomásek Branislav Bosanský Thanh Hong Nguyen Using One-Sided Partially Observable Stochastic Games for Solving Zero-Sum Security Games with Sequential Attacks. 385-404 2020 GameSec https://doi.org/10.1007/978-3-030-64793-3_21 conf/gamesec/2020 db/conf/gamesec/gamesec2020.html#TomasekBN20 Jakub Cerný Viliam Lisý Branislav Bosanský Bo An 0001 Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium. 246-253 2020 IJCAI https://doi.org/10.24963/ijcai.2020/35 conf/ijcai/2020 db/conf/ijcai/ijcai2020.html#CernyLB020 Jirí Cermák Viliam Lisý Branislav Bosanský Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract). 5030-5034 2020 Journal track IJCAI https://doi.org/10.24963/ijcai.2020/701 conf/ijcai/2020 db/conf/ijcai/ijcai2020.html#CermakLB20 Jakub Cerný Branislav Bosanský Bo An 0001 Finite State Machines Play Extensive-Form Games. 509-533 2020 EC https://doi.org/10.1145/3391403.3399517 https://www.wikidata.org/entity/Q130980585 conf/sigecom/2020 db/conf/sigecom/sigecom2020.html#CernyB020

Karel Horák 0002 Branislav Bosanský Vojtech Kovarík Christopher Kiekintveld Solving Zero-Sum One-Sided Partially Observable Stochastic Games. 2020 abs/2010.11243 CoRR https://arxiv.org/abs/2010.11243 db/journals/corr/corr2010.html#abs-2010-11243

Karel Durkota Viliam Lisý Branislav Bosanský Christopher Kiekintveld Michal Pechoucek Hardening networks against strategic attackers using attack graph games. 2019 87 Comput. Secur. https://doi.org/10.1016/j.cose.2019.101578 https://www.wikidata.org/entity/Q115058109 db/journals/compsec/compsec87.html#DurkotaLBKP19

Karel Horák 0002 Branislav Bosanský Petr Tomásek Christopher Kiekintveld Charles A. Kamhoua Optimizing honeypot strategies against dynamic lateral movement using partially observable stochastic games. 2019 87 Comput. Secur. https://doi.org/10.1016/j.cose.2019.101579 https://www.wikidata.org/entity/Q115058061 db/journals/compsec/compsec87.html#HorakBTKK19

Karel Horák 0002 Branislav Bosanský Solving Partially Observable Stochastic Games with Public Observations. 2029-2036 2019 AAAI https://doi.org/10.1609/aaai.v33i01.33012029 conf/aaai/2019 db/conf/aaai/aaai2019.html#HorakB19 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. 394-400 2019 CogSci https://escholarship.org/uc/item/2gn3w566 conf/cogsci/2019 db/conf/cogsci/cogsci2019.html#GutierrezCBABKG19 Thanh Hong Nguyen Amulya Yadav Branislav Bosanský Yu Liang 0002 Tackling Sequential Attacks in Security Games. 331-351 2019 GameSec https://doi.org/10.1007/978-3-030-32430-8_20 conf/gamesec/2019 db/conf/gamesec/gamesec2019.html#NguyenYBL19 Xinrun Wang Milind Tambe Branislav Bosanský Bo An 0001 When Players Affect Target Values: Modeling and Solving Dynamic Partially Observable Security Games. 542-562 2019 GameSec https://doi.org/10.1007/978-3-030-32430-8_32 conf/gamesec/2019 db/conf/gamesec/gamesec2019.html#WangTBA19 Pavel Rytír Lukás Chrpa Branislav Bosanský Using Classical Planning in Adversarial Problems. 1335-1340 2019 ICTAI https://doi.org/10.1109/ICTAI.2019.00185 conf/ictai/2019 db/conf/ictai/ictai2019.html#RytirCB19 Karel Horák 0002 Branislav Bosanský Christopher Kiekintveld Charles A. Kamhoua Compact Representation of Value Function in Partially Observable Stochastic Games. 2019 IJCAI https://doi.org/10.24963/ijcai.2019/50 conf/ijcai/2019 db/conf/ijcai/ijcai2019.html#HorakBKK19 350-356

Karel Horák 0002 Branislav Bosanský Christopher Kiekintveld Charles A. Kamhoua Compact Representation of Value Function in Partially Observable Stochastic Games. 2019 abs/1903.05511 CoRR http://arxiv.org/abs/1903.05511 db/journals/corr/corr1903.html#abs-1903-05511

Jirí Cermák Branislav Bosanský Karel Horák 0002 Viliam Lisý Michal Pechoucek Approximating maxmin strategies in imperfect recall games using A-loss recall property. 290-326 2018 93 Int. J. Approx. Reason. https://doi.org/10.1016/j.ijar.2017.11.010 https://www.wikidata.org/entity/Q59209593 db/journals/ijar/ijar93.html#CermakBHLP18

Anjon Basak Jakub Cerný Marcus Gutierrez Shelby R. Curtis Charles A. Kamhoua Daniel Jones 0003 Branislav Bosanský Christopher Kiekintveld An Initial Study of Targeted Personality Models in the FlipIt Game. 623-636 2018 GameSec https://doi.org/10.1007/978-3-030-01554-1_36 conf/gamesec/2018 db/conf/gamesec/gamesec2018.html#BasakCGCKJBK18 Karel Horák 0002 Branislav Bosanský Krishnendu Chatterjee Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs. 4764-4770 2018 IJCAI https://doi.org/10.24963/ijcai.2018/662 conf/ijcai/2018 db/conf/ijcai/ijcai2018.html#HorakBC18 Jakub Cerný Branislav Bosanský Christopher Kiekintveld Incremental Strategy Generation for Stackelberg Equilibria in Extensive-Form Games. 151-168 2018 EC https://doi.org/10.1145/3219166.3219219 conf/sigecom/2018 db/conf/sigecom/sigecom2018.html#CernyBK18

Jiri Cermak Viliam Lisý Branislav Bosanský Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games. 2018 abs/1803.05392 CoRR http://arxiv.org/abs/1803.05392 db/journals/corr/corr1803.html#abs-1803-05392

Branislav Bosanský Simina Brânzei Kristoffer Arnsfelt Hansen Troels Bjerre Lund Peter Bro Miltersen Computation of Stackelberg Equilibria of Finite Sequential Games. 23:1-23:24 2017 5 ACM Trans. Economics and Comput. 4 https://doi.org/10.1145/3133242 db/journals/teco/teco5.html#BosanskyBHLM17

Jiri Cermak Branislav Bosanský Towards Solving Imperfect Recall Games. 2017 AAAI Workshops https://aaai.org/papers/aaaiw-ws0384-17-15192/ conf/aaai/2017w db/conf/aaai/aaai2017w.html#CermakB17 Jiri Cermak Branislav Bosanský Michal Pechoucek Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. 2017 AAAI Workshops https://aaai.org/papers/aaaiw-ws0382-17-15190/ conf/aaai/2017w db/conf/aaai/aaai2017w.html#CermakBP17 Qingyu Guo Bo An 0001 Branislav Bosanský Christopher Kiekintveld Strategic Information Revelation and Commitment in Security Games. 2017 AAAI Workshops https://aaai.org/papers/aaaiw-ws0305-17-15104/ conf/aaai/2017w db/conf/aaai/aaai2017w.html#GuoABK17 Karel Horák 0002 Branislav Bosanský Michal Pechoucek Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games. 558-564 2017 AAAI https://doi.org/10.1609/aaai.v31i1.10597 conf/aaai/2017 db/conf/aaai/aaai2017.html#HorakBP17 Jirí Cermák Branislav Bosanský Michal Pechoucek Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games. 902-910 2017 AAMAS http://dl.acm.org/citation.cfm?id=3091253 conf/atal/2017 db/conf/atal/aamas2017.html#CermakBP17 Karel Durkota Viliam Lisý Christopher Kiekintveld Karel Horák 0002 Branislav Bosanský Tomás Pevný Optimal Strategies for Detecting Data Exfiltration by Internal and External Attackers. 171-192 2017 GameSec https://doi.org/10.1007/978-3-319-68711-7_10 conf/gamesec/2017 db/conf/gamesec/gamesec2017.html#DurkotaLKHBP17 Karel Horák 0002 Quanyan Zhu Branislav Bosanský Manipulating Adversary's Belief: A Dynamic Game Approach to Deception by Design for Proactive Network Security. 273-294 2017 GameSec https://doi.org/10.1007/978-3-319-68711-7_15 conf/gamesec/2017 db/conf/gamesec/gamesec2017.html#HorakZB17 Branislav Bosanský Jiri Cermak Karel Horák 0002 Michal Pechoucek Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall. 63-74 2017 ICAART (2) https://doi.org/10.5220/0006121200630074 conf/icaart/2017-2 db/conf/icaart/icaart2017-2.html#BosanskyCHP17 Karel Horák 0002 Branislav Bosanský Dynamic Programming for One-sided Partially Observable Pursuit-evasion Games. 503-510 2017 ICAART (2) https://doi.org/10.5220/0006190605030510 conf/icaart/2017-2 db/conf/icaart/icaart2017-2.html#HorakB17 Jiri Cermak Branislav Bosanský Viliam Lisý An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games. 936-942 2017 IJCAI https://doi.org/10.24963/ijcai.2017/130 conf/ijcai/2017 db/conf/ijcai/ijcai2017.html#CermakBL17 Qingyu Guo Bo An 0001 Branislav Bosanský Christopher Kiekintveld Comparing Strategic Secrecy and Stackelberg Commitment in Security Games. 3691-3699 2017 IJCAI https://doi.org/10.24963/ijcai.2017/516 conf/ijcai/2017 db/conf/ijcai/ijcai2017.html#GuoABK17

Branislav Bosanský Viliam Lisý Marc Lanctot Jirí Cermák Mark H. M. Winands Algorithms for computing strategies in two-player simultaneous move games. 1-40 2016 237 Artif. Intell. https://doi.org/10.1016/j.artint.2016.03.005 https://www.wikidata.org/entity/Q59209595 db/journals/ai/ai237.html#BosanskyLLCW16

Karel Durkota Viliam Lisý Christopher Kiekintveld Branislav Bosanský Michal Pechoucek Case Studies of Network Defense with Attack Graph Games. 24-30 2016 31 IEEE Intell. Syst. 5 https://doi.org/10.1109/MIS.2016.74 http://doi.ieeecomputersociety.org/10.1109/MIS.2016.74 https://www.wikidata.org/entity/Q59209596 db/journals/expert/expert31.html#DurkotaLKBP16

Jiri Cermak Branislav Bosanský Karel Durkota Viliam Lisý Christopher Kiekintveld Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games. 439-445 2016 AAAI https://doi.org/10.1609/aaai.v30i1.10045 conf/aaai/2016 db/conf/aaai/aaai2016.html#CermakBDLK16 Karel Horák 0002 Branislav Bosanský A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games. 435-454 2016 GameSec https://doi.org/10.1007/978-3-319-47413-7_25 conf/gamesec/2016 db/conf/gamesec/gamesec2016.html#HorakB16

Karel Horák 0002 Branislav Bosanský Dynamic Programming for One-Sided Partially Observable Pursuit-Evasion Games. 2016 abs/1606.06271 CoRR http://arxiv.org/abs/1606.06271 db/journals/corr/corr1606.html#HorakB16

Branislav Bosanský Jiri Cermak Karel Horák 0002 Michal Pechoucek Computing Maxmin Strategies in Extensive-Form Zero-Sum Games with Imperfect Recall. 2016 abs/1608.01510 CoRR http://arxiv.org/abs/1608.01510 db/journals/corr/corr1608.html#BosanskyCHP16

Branislav Bosanský Jiri Cermak Sequence-Form Algorithm for Computing Stackelberg Equilibria in Extensive-Form Games. 805-811 2015 AAAI https://doi.org/10.1609/aaai.v29i1.9304 conf/aaai/2015 db/conf/aaai/aaai2015.html#BosanskyC15 Branislav Bosanský Albert Xin Jiang Milind Tambe Christopher Kiekintveld Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies. 812-818 2015 AAAI https://doi.org/10.1609/aaai.v29i1.9319 conf/aaai/2015 db/conf/aaai/aaai2015.html#BosanskyJTK15 Karel Durkota Viliam Lisý Christopher Kiekintveld Branislav Bosanský Game-Theoretic Algorithms for Optimal Network Security Hardening Using Attack Graphs. 1773-1774 2015 AAMAS http://dl.acm.org/citation.cfm?id=2773429 conf/atal/2015 db/conf/atal/aamas2015.html#DurkotaLKB15 Jirí Cermák Branislav Bosanský Nicola Gatti 0001 Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games. 1813-1814 2015 AAMAS http://dl.acm.org/citation.cfm?id=2773450 conf/atal/2015 db/conf/atal/aamas2015.html#CermakBG15 Karel Durkota Viliam Lisý Branislav Bosanský Christopher Kiekintveld Approximate Solutions for Attack Graph Games with Imperfect Information. 228-249 2015 GameSec https://doi.org/10.1007/978-3-319-25594-1_13 https://www.wikidata.org/entity/Q59209600 conf/gamesec/2015 db/conf/gamesec/gamesec2015.html#DurkotaLBK15 Karel Durkota Viliam Lisý Branislav Bosanský Christopher Kiekintveld Optimal Network Security Hardening Using Attack Graph Games. 526-532 2015 IJCAI http://ijcai.org/Abstract/15/080 conf/ijcai/2015 db/conf/ijcai/ijcai2015.html#DurkotaLBK15 Branislav Bosanský Simina Brânzei Kristoffer Arnsfelt Hansen Peter Bro Miltersen Troels Bjerre Sørensen Computation of Stackelberg Equilibria of Finite Sequential Games. 201-215 2015 WINE https://doi.org/10.1007/978-3-662-48995-6_15 conf/wine/2015 db/conf/wine/wine2015.html#BosanskyBHMS15

Branislav Bosanský Simina Brânzei Kristoffer Arnsfelt Hansen Peter Bro Miltersen Troels Bjerre Sørensen Computation of Stackelberg Equilibria of Finite Sequential Games. 2015 abs/1507.07677 CoRR http://arxiv.org/abs/1507.07677 db/journals/corr/corr1507.html#BosanskyBHMS15

Branislav Bosanský Christopher Kiekintveld Viliam Lisý Michal Pechoucek An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information. 829-866 2014 51 J. Artif. Intell. Res. https://doi.org/10.1613/jair.4477 db/journals/jair/jair51.html#BosanskyKLP14

Michal Abaffy Tomás Brázdil Vojtech Rehák Branislav Bosanský Antonín Kucera 0001 Jan Krcál Solving adversarial patrolling games with bounded error: (extended abstract). 1617-1618 2014 AAMAS http://dl.acm.org/citation.cfm?id=2616090 conf/atal/2014 db/conf/atal/aamas2014.html#AbaffyBRBKK14 Jirí Cermák Branislav Bosanský Viliam Lisý Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games. 201-206 2014 ECAI https://doi.org/10.3233/978-1-61499-419-0-201 conf/ecai/2014 db/conf/ecai/ecai2014.html#CermakBL14 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. 335-342 2013 AAMAS http://dl.acm.org/citation.cfm?id=2484975 conf/atal/2013 db/conf/atal/aamas2013.html#BosanskyKLCP13 Branislav Bosanský Solving extensive-form games with double-oracle methods. 1423-1424 2013 AAMAS http://dl.acm.org/citation.cfm?id=2485257 conf/atal/2013 db/conf/atal/aamas2013.html#Bosansky13 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. 2013 IJCAI http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6815 http://ijcai.org/Abstract/13/018 conf/ijcai/2013 db/conf/ijcai/ijcai2013.html#BosanskyLCVP13 48-54 Viliam Lisý Vojtech Kovarík Marc Lanctot Branislav Bosanský Convergence of Monte Carlo Tree Search in Simultaneous Move Games. 2112-2120 2013 NIPS https://proceedings.neurips.cc/paper/2013/hash/1579779b98ce9edb98dd85606f2c119d-Abstract.html http://papers.nips.cc/paper/5145-convergence-of-monte-carlo-tree-search-in-simultaneous-move-games conf/nips/2013 db/conf/nips/nips2013.html#LisyKLB13

Viliam Lisý Vojtech Kovarík Marc Lanctot Branislav Bosanský Convergence of Monte Carlo Tree Search in Simultaneous Move Games. 2013 CoRR http://arxiv.org/abs/1310.8613 abs/1310.8613 db/journals/corr/corr1310.html#LisyKLB13

Branislav Bosanský Ondrej Vanek Michal Pechoucek Strategy Representation Analysis for Patrolling Games. 2012 AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health http://www.aaai.org/ocs/index.php/SSS/SSS12/paper/view/4312 conf/aaaiss/2012-3 db/conf/aaaiss/aaaiss2012-03.html#BosanskyVP12 Ondrej Vanek Branislav Bosanský Michal Jakob Viliam Lisý Michal Pechoucek Extending Security Games to Defenders with Constrained Mobility. 2012 AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health http://www.aaai.org/ocs/index.php/SSS/SSS12/paper/view/4276 conf/aaaiss/2012-3 db/conf/aaaiss/aaaiss2012-03.html#VanekBJLP12 Ondrej Vanek Zhengyu Yin Manish Jain Branislav Bosanský Milind Tambe Michal Pechoucek Game-theoretic resource allocation for malicious packet detection in computer networks. 905-912 2012 AAMAS http://dl.acm.org/citation.cfm?id=2343826 conf/atal/2012 db/conf/atal/aamas2012.html#VanekYJBTP12 Viliam Lisý Branislav Bosanský Michal Pechoucek Anytime algorithms for multi-agent visibility-based pursuit-evasion games. 1301-1302 2012 AAMAS http://dl.acm.org/citation.cfm?id=2343974 conf/atal/2012 db/conf/atal/aamas2012.html#LisyBP12 Peter Novák 0001 Antonín Komenda Viliam Lisý Branislav Bosanský Michal Cáp Michal Pechoucek Tactical operations of multi-robot teams in urban warfare (demonstration). 1473-1474 2012 AAMAS http://dl.acm.org/citation.cfm?id=2344067 conf/atal/2012 db/conf/atal/aamas2012.html#NovakKLBcP12 Branislav Bosanský Christopher Kiekintveld Viliam Lisý Michal Pechoucek Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information. 193-198 2012 ECAI https://doi.org/10.3233/978-1-61499-098-7-193 conf/ecai/2012 db/conf/ecai/ecai2012.html#BosanskyKLP12 Viliam Lisý Radek Píbil Jan Stiborek Branislav Bosanský Michal Pechoucek Game-theoretic Approach to Adversarial Plan Recognition. 546-551 2012 ECAI https://doi.org/10.3233/978-1-61499-098-7-546 conf/ecai/2012 db/conf/ecai/ecai2012.html#LisyPSBP12 Radek Píbil Viliam Lisý Christopher Kiekintveld Branislav Bosanský Michal Pechoucek Game Theoretic Model of Strategic Honeypot Selection in Computer Networks. 201-220 2012 GameSec https://doi.org/10.1007/978-3-642-34266-0_12 https://www.wikidata.org/entity/Q59209614 conf/gamesec/2012 db/conf/gamesec/gamesec2012.html#PibilLKBP12 Branislav Bosanský Viliam Lisý Michal Jakob Michal Pechoucek Computing time-dependent policies for patrolling games with mobile targets. 989-996 2011 AAMAS http://portal.acm.org/citation.cfm?id=2034410&CFID=69154334&CFTOKEN=45298625 conf/atal/2011 db/conf/atal/aamas2011.html#BosanskyLJP11 Ondrej Vanek Michal Jakob Viliam Lisý Branislav Bosanský Michal Pechoucek Iterative game-theoretic route selection for hostile area transit and patrolling. 1273-1274 2011 AAMAS http://portal.acm.org/citation.cfm?id=2034522&CFID=69154334&CFTOKEN=45298625 conf/atal/2011 db/conf/atal/aamas2011.html#VanekJLBP11 Michal Jakob Ondrej Vanek Branislav Bosanský Ondrej Hrstka Michal Pechoucek AgentC: agent-based system for securing maritime transit. 1309-1310 2011 AAMAS http://portal.acm.org/citation.cfm?id=2034540&CFID=69154334&CFTOKEN=45298625 conf/atal/2011 db/conf/atal/aamas2011.html#JakobVBHP11 Branislav Bosanský Viliam Lisý Michal Pechoucek Towards Cooperation in Adversarial Search with Confidentiality. 246-255 2011 HoloMAS https://doi.org/10.1007/978-3-642-23181-0_24 https://www.wikidata.org/entity/Q59209616 conf/holomas/2011 db/conf/holomas/holomas2011.html#BosanskyLP11 Lenka Lhotská Branislav Bosanský Jaromir Dolezal Integration of Procedural Knowledge in Multi-Agent Systems in Medicine. 82-95 2011 ITBAM https://doi.org/10.1007/978-3-642-23208-4_8 conf/itbam/2011 db/conf/itbam/itbam2011.html#LhotskaBD11 Ondrej Vanek Branislav Bosanský Michal Jakob Michal Pechoucek Transiting areas patrolled by a mobile adversary. 9-16 2010 CIG https://doi.org/10.1109/ITW.2010.5593377 conf/cig/2010 db/conf/cig/cig2010.html#VanekBJP10 Viliam Lisý Branislav Bosanský Roman Vaculín Michal Pechoucek Agent subset adversarial search for complex non-cooperative domains. 211-218 2010 CIG https://doi.org/10.1109/ITW.2010.5593351 https://www.wikidata.org/entity/Q59209620 conf/cig/2010 db/conf/cig/cig2010.html#LisyBVP10 Viliam Lisý Branislav Bosanský Michal Jakob Michal Pechoucek Adversarial search with procedural knowledge heuristic. 899-906 2009 AAMAS (2) https://dl.acm.org/citation.cfm?id=1558137 conf/atal/2009-2 db/conf/atal/aamas2009-2.html#LisyBJP09 Viliam Lisý Branislav Bosanský Michal Jakob Michal Pechoucek Goal-based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic. 53-60 2009 ICAART conf/icaart/2009 db/conf/icaart/icaart2009.html#LisyBJP09 Viliam Lisý Branislav Bosanský Michal Jakob Michal Pechoucek Goal-Based Game Tree Search for Complex Domains. 97-109 2009 ICAART (Revised Selected Papers) https://doi.org/10.1007/978-3-642-11819-7_8 https://www.wikidata.org/entity/Q59209622 conf/icaart/2009s db/conf/icaart/icaart2009s.html#LisyBJP09a Branislav Bosanský Cyril Brom Agent-Based Simulation of Business Processes in a Virtual World. 86-94 2008 HAIS https://doi.org/10.1007/978-3-540-87656-4_12 https://www.wikidata.org/entity/Q57705687 conf/hais/2008 db/conf/hais/hais2008.html#BosanskyB08 Michal Abaffy Efrat Aharonov-Majar Galina Alperovich Bo An 0001 Ahmed H. Anwar Simone Aonzo Aditya Aradhye Elnaz Babayeva Anjon Basak Noam Ben-Asher Simina Brânzei Tomás Brázdil Cyril Brom Michal Cáp Lorenzo Cavallaro Jiri CermakJirí Cermák Jakub Cerný Krishnendu Chatterjee Lukás Chrpa Jacopo Cortellazzi Shelby R. Curtis Jaromir Dolezal Karel Durkota Marek Galovic Nicola Gatti 0001 Cleotilde Gonzalez Qingyu Guo Marcus Paul GutierrezMarcus Gutierrez Kristoffer Arnsfelt Hansen Michael Hlavácek Karel Horák 0002 Lada Hospodkova Ondrej Hrstka Manish Jain Michal Jakob Albert Xin Jiang Daniel Jones 0003 Wouter Joosen Charles A. Kamhoua Christopher Kiekintveld Antonín Komenda Dominik Kouba Vojtech Kovarík Jan Krcál Jakub Kroustek Antonín Kucera 0001 Marc Lanctot Lenka Lhotská Yu Liang 0002 Viliam Lisý Troels Bjerre LundTroels Bjerre Sørensen Ondrej Manhal Peter Bro Miltersen Michal Najman Thanh Hong Nguyen Peter Novák 0001 Michal Pechoucek Olga Petrova Tomás Pevný Radek Píbil Fabio Pierazzi Davy Preuveneers Stefan Rass Vojtech Rehák Maria Rigaki Pavel Rytír Md. Abu Sayed Thorsten Sick Arunesh Sinha Petr Somol Jan Stiborek Milind Tambe Petr Tomásek Ilias Tsingenopoulos Roman Vaculín Ondrej Vanek Roman Vitek Xinrun Wang Mark H. M. Winands Amulya Yadav Zhengyu Yin Quanyan Zhu