Unconstrained Influence Diagram Solver: Guido. - Jirí Isa; Viliam Lisý; Zuzana Reitermanová; Ondrej Sýkora (ICTAI (1), 2007)

Utility-based model for classifying adversarial behaviour in multi-agent systems. - Viliam Lisý; Michal Jakob; Jan Tozicka; Michal Pechoucek (IMCSIT, 2008)

Towards Cooperative Predictive Data Mining in Competitive Environments. - Viliam Lisý; Michal Jakob; Petr Benda; Stepán Urban; Michal Pechoucek (ADMI, 2009)

Adversarial search with procedural knowledge heuristic. - Viliam Lisý; Branislav Bosanský; Michal Jakob; Michal Pechoucek (AAMAS (2), 2009)

Affective Man-Machine Interface: Unveiling Human Emotions through Biosignals. - Egon L. van den Broek; Viliam Lisý; Joris H. Janssen; Joyce H. D. M. Westerink; Marleen H. Schut; Kees Tuinenbreijer (BIOSTEC (Selected Papers), 2009)

Biosignals as an Advanced Man-Machine Interface. - Egon L. van den Broek; Viliam Lisý; Joyce H. D. M. Westerink; Marleen H. Schut; Kees Tuinenbreijer (BIOSTEC, 2009)

Goal-based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic. - Viliam Lisý; Branislav Bosanský; Michal Jakob; Michal Pechoucek (ICAART, 2009)

Goal-Based Game Tree Search for Complex Domains. - Viliam Lisý; Branislav Bosanský; Michal Jakob; Michal Pechoucek (ICAART (Revised Selected Papers), 2009)

Adversarial planning for large multi-agent simulations. - Viliam Lisý (AAMAS, 2010)

Deception in networks of mobile sensing agents. - Viliam Lisý; Roie Zivan; Katia P. Sycara; Michal Pechoucek (AAMAS, 2010)

Agent subset adversarial search for complex non-cooperative domains. - Viliam Lisý; Branislav Bosanský; Roman Vaculín; Michal Pechoucek (CIG, 2010)

Computing time-dependent policies for patrolling games with mobile targets. - Branislav Bosanský; Viliam Lisý; Michal Jakob; Michal Pechoucek (AAMAS, 2011)

Iterative game-theoretic route selection for hostile area transit and patrolling. - Ondrej Vanek; Michal Jakob; Viliam Lisý; Branislav Bosanský; Michal Pechoucek (AAMAS, 2011)

Towards Cooperation in Adversarial Search with Confidentiality. - Branislav Bosanský; Viliam Lisý; Michal Pechoucek (HoloMAS, 2011)

Extending Security Games to Defenders with Constrained Mobility. - Ondrej Vanek; Branislav Bosanský; Michal Jakob; Viliam Lisý; Michal Pechoucek (AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health, 2012)

Anytime algorithms for multi-agent visibility-based pursuit-evasion games. - Viliam Lisý; Branislav Bosanský; Michal Pechoucek (AAMAS, 2012)

Tactical operations of multi-robot teams in urban warfare (demonstration). - Peter Novák 001; Antonín Komenda; Viliam Lisý; Branislav Bosanský; Michal Cáp; Michal Pechoucek (AAMAS, 2012)

Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information. - Branislav Bosanský; Christopher Kiekintveld; Viliam Lisý; Michal Pechoucek (ECAI, 2012)

Game-theoretic Approach to Adversarial Plan Recognition. - Viliam Lisý; Radek Píbil; Jan Stiborek; Branislav Bosanský; Michal Pechoucek (ECAI, 2012)

Game Theoretic Model of Strategic Honeypot Selection in Computer Networks. - Radek Píbil; Viliam Lisý; Christopher Kiekintveld; Branislav Bosanský; Michal Pechoucek (GameSec, 2012)

Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games. - Branislav Bosanský; Christopher Kiekintveld; Viliam Lisý; Jiri Cermak; Michal Pechoucek (AAMAS, 2013)

Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games. - Branislav Bosanský; Viliam Lisý; Jiri Cermak; Roman Vitek; Michal Pechoucek (IJCAI, 2013)

Monte Carlo Tree Search in Simultaneous Move Games with Applications to Goofspiel. - Marc Lanctot; Viliam Lisý; Mark H. M. Winands (CGW@IJCAI, 2013)

Convergence of Monte Carlo Tree Search in Simultaneous Move Games. - Viliam Lisý; Vojtech Kovarík; Marc Lanctot; Branislav Bosanský (NIPS, 2013)

Computing Optimal Attack Strategies Using Unconstrained Influence Diagrams. - Viliam Lisý; Radek Píbil (PAISI, 2013)

Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games. - Jirí Cermák; Branislav Bosanský; Viliam Lisý (ECAI, 2014)

Online Learning Methods for Border Patrol Resource Allocation. - Richard Klíma; Christopher Kiekintveld; Viliam Lisý (GameSec, 2014)

Randomized Operating Point Selection in Adversarial Classification. - Viliam Lisý; Robert Kessl; Tomás Pevný (ECML/PKDD (2), 2014)

Computing Optimal Policies for Attack Graphs with Action Failures and Costs. - Karel Durkota; Viliam Lisý (STAIRS, 2014)

An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information. - Branislav Bosanský; Christopher Kiekintveld; Viliam Lisý; Michal Pechoucek (J. Artif. Intell. Res., 2014)

Game-Theoretic Algorithms for Optimal Network Security Hardening Using Attack Graphs. - Karel Durkota; Viliam Lisý; Christopher Kiekintveld; Branislav Bosanský (AAMAS, 2015)

Online Monte Carlo Counterfactual Regret Minimization for Search in Imperfect Information Games. - Viliam Lisý; Marc Lanctot; Michael H. Bowling (AAMAS, 2015)

Approximate Solutions for Attack Graph Games with Imperfect Information. - Karel Durkota; Viliam Lisý; Branislav Bosanský; Christopher Kiekintveld (GameSec, 2015)

Combining Online Learning and Equilibrium Computation in Security Games. - Richard Klíma; Viliam Lisý; Christopher Kiekintveld (GameSec, 2015)

Optimal Network Security Hardening Using Attack Graph Games. - Karel Durkota; Viliam Lisý; Branislav Bosanský; Christopher Kiekintveld (IJCAI, 2015)

Game-Theoretic Foundations for the Strategic Use of Honeypots in Network Security. - Christopher Kiekintveld; Viliam Lisý; Radek Píbil (Cyber Warfare, 2015)

Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games. - Jiri Cermak; Branislav Bosanský; Karel Durkota; Viliam Lisý; Christopher Kiekintveld (AAAI, 2016)

Counterfactual Regret Minimization in Sequential Security Games. - Viliam Lisý; Trevor Davis 001; Michael H. Bowling (AAAI, 2016)

Monte Carlo Tree Search in Continuous Action Spaces with Execution Uncertainty. - Timothy Yee; Viliam Lisý; Michael H. Bowling (IJCAI, 2016)

Algorithms for computing strategies in two-player simultaneous move games. - Branislav Bosanský; Viliam Lisý; Marc Lanctot; Jirí Cermák; Mark H. M. Winands (Artif. Intell., 2016)

Reports of the 2016 AAAI Workshop Program. - Stefano V. Albrecht; Bruno Bouchard 001; John S. Brownstein; David L. Buckeridge; Cornelia Caragea; Kevin M. Carter 001; Adnan Darwiche; Blaz Fortuna; Yannick Francillette; Sébastien Gaboury; C. Lee Giles; Marko Grobelnik; et al. (AI Mag., 2016)

Case Studies of Network Defense with Attack Graph Games. - Karel Durkota; Viliam Lisý; Christopher Kiekintveld; Branislav Bosanský; Michal Pechoucek (IEEE Intell. Syst., 2016)

Eqilibrium Approximation Quality of Current No-Limit Poker Bots. - Viliam Lisý; Michael Bowling (AAAI Workshops, 2017)

Path Hopping: an MTD Strategy for Quantum-safe Communication. - Reihaneh Safavi-Naini; Alireza Poostindouz; Viliam Lisý (MTD@CCS, 2017)

Economically Optimal Variable Tag Length Message Authentication. - Reihaneh Safavi-Naini; Viliam Lisý; Yvo Desmedt (Financial Cryptography, 2017)

Optimal Strategies for Detecting Data Exfiltration by Internal and External Attackers. - Karel Durkota; Viliam Lisý; Christopher Kiekintveld; Karel Horák 002; Branislav Bosanský; Tomás Pevný (GameSec, 2017)

An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games. - Jiri Cermak; Branislav Bosanský; Viliam Lisý (IJCAI, 2017)

Reports of the Workshops of the Thirty-First AAAI Conference on Artificial Intelligence. - Monica Anderson 001; Roman Barták; John S. Brownstein; David L. Buckeridge; Hoda Eldardiry; Christopher W. Geib; Maria L. Gini; Aaron Isaksen; Sarah Keren; Robert Laddaga; Viliam Lisý; Rodney Martin; et al. (AI Mag., 2017)

DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker. - Matej Moravcík; Martin Schmid; Neil Burch; Viliam Lisý; Dustin Morrill; Nolan Bard; Trevor Davis 001; Kevin Waugh; Michael Johanson; Michael H. Bowling (CoRR, 2017)

Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games. - Jiri Cermak; Viliam Lisý; Branislav Bosanský (CoRR, 2018)

Approximating maxmin strategies in imperfect recall games using A-loss recall property. - Jirí Cermák; Branislav Bosanský; Karel Horák 002; Viliam Lisý; Michal Pechoucek (Int. J. Approx. Reason., 2018)

Path Hopping: An MTD Strategy for Long-Term Quantum-Safe Communication. - Reihaneh Safavi-Naini; Alireza Poostindouz; Viliam Lisý (Secur. Commun. Networks, 2018)

Classification with Costly Features Using Deep Reinforcement Learning. - Jaromír Janisch; Tomás Pevný; Viliam Lisý (AAAI, 2019)

Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games. - Michal Sustr; Vojtech Kovarík; Viliam Lisý (AAMAS, 2019)

Hardening networks against strategic attackers using attack graph games. - Karel Durkota; Viliam Lisý; Branislav Bosanský; Christopher Kiekintveld; Michal Pechoucek (Comput. Secur., 2019)

Problems with the EFG formalism: a solution attempt using observations. - Vojtech Kovarík; Viliam Lisý (CoRR, 2019)

Value Functions for Depth-Limited Solving in Zero-Sum Imperfect-Information Games. - Vojtech Kovarík; Viliam Lisý (CoRR, 2019)

Deep Reinforcement Learning with Explicitly Represented Knowledge and Variable State and Action Spaces. - Jaromír Janisch; Tomás Pevný; Viliam Lisý (CoRR, 2019)

Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection. - Olga Petrova; Karel Durkota; Galina Alperovich; Karel Horák 002; Michal Najman; Branislav Bosanský; Viliam Lisý (AAMAS, 2020)

Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract). - Jirí Cermák; Viliam Lisý; Branislav Bosanský (IJCAI, 2020)

Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium. - Jakub Cerný; Viliam Lisý; Branislav Bosanský; Bo An 001 (IJCAI, 2020)

Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games. - Jirí Cermák; Viliam Lisý; Branislav Bosanský (Artif. Intell., 2020)

Symbolic Relational Deep Reinforcement Learning based on Graph Neural Networks. - Jaromír Janisch; Tomás Pevný; Viliam Lisý (CoRR, 2020)

Classification with costly features as a sequential decision-making problem. - Jaromír Janisch; Tomás Pevný; Viliam Lisý (Mach. Learn., 2020)

Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games. - Vojtech Kovarík; Viliam Lisý (Mach. Learn., 2020)

Computing Quantal Stackelberg Equilibrium in Extensive-Form Games. - Jakub Cerný; Viliam Lisý; Branislav Bosanský; Bo An 001 (AAAI, 2021)

Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games. - David Milec; Jakub Cerný; Viliam Lisý; Bo An 001 (AAAI, 2021)

Multi-agent Reinforcement Learning in OpenSpiel: A Reproduction Report. - Michael Walton; Viliam Lisý (CoRR, 2021)

Mill.jl and JsonGrinder.jl: automated differentiable feature extraction for learning from raw JSON data. - Simon Mandlík; Matej Racinsky; Viliam Lisý; Tomás Pevný (CoRR, 2021)

Improving Robustness of Malware Classifiers using Adversarial Strings Generated from Perturbed Latent Representations. - Marek Galovic; Branislav Bosanský; Viliam Lisý (CoRR, 2021)

Fast Algorithms for Poker Require Modelling it as a Sequential Bayesian Game. - Vojtech Kovarík; David Milec; Michal Sustr; Dominik Seitz; Viliam Lisý (CoRR, 2021)

Continual Depth-limited Responses for Computing Counter-strategies in Extensive-form Games. - David Milec; Viliam Lisý (CoRR, 2021)

Rethinking formal models of partially observable multiagent decision making. - Vojtech Kovarík; Martin Schmid; Neil Burch; Michael Bowling; Viliam Lisý (Artif. Intell., 2022)

Explaining Classifiers Trained on Raw Hierarchical Multiple-Instance Data. - Tomás Pevný; Viliam Lisý; Branislav Bosanský; Petr Somol; Michal Pechoucek (CoRR, 2022)

Avast-CTU Public CAPE Dataset. - Branislav Bosanský; Dominik Kouba; Ondrej Manhal; Thorsten Sick; Viliam Lisý; Jakub Kroustek; Petr Somol (CoRR, 2022)

JsonGrinder.jl: automated differentiable neural architecture for embedding arbitrary JSON data. - Simon Mandlík; Matej Racinsky; Viliam Lisý; Tomás Pevný (J. Mach. Learn. Res., 2022)

NASimEmu: Network Attack Simulator & Emulator for Training Agents Generalizing to Novel Scenarios. - Jaromír Janisch; Tomás Pevný; Viliam Lisý (ESORICS Workshops (2), 2023)

Rethinking Formal Models of Partially Observable Multiagent Decision Making (Extended Abstract). - Vojtech Kovarík; Martin Schmid; Neil Burch; Michael Bowling; Viliam Lisý (IJCAI, 2023)

Value functions for depth-limited solving in zero-sum imperfect-information games. - Vojtech Kovarík; Dominik Seitz; Viliam Lisý; Jan Rudolf; Shuo Sun; Karel Ha (Artif. Intell., 2023)

Generation of Games for Opponent Model Differentiation. - David Milec; Viliam Lisý; Christopher Kiekintveld (CoRR, 2023)

Continual Depth-limited Responses for Computing Counter-strategies in Sequential Games. - David Milec; Ondrej Kubícek; Viliam Lisý (AAMAS, 2024)

Look-ahead Search on Top of Policy Networks in Imperfect Information Games. - Ondrej Kubícek; Neil Burch; Viliam Lisý (IJCAI, 2024)

Counteracting Concept Drift by Learning with Future Malware Predictions. - Branislav Bosanský; Lada Hospodkova; Michal Najman; Maria Rigaki; Elnaz Babayeva; Viliam Lisý (CoRR, 2024)

Classification with costly features in hierarchical deep sets. - Jaromír Janisch; Tomás Pevný; Viliam Lisý (Mach. Learn., 2024)

Adapting Beyond the Depth Limit: Counter Strategies in Large Imperfect Information Games. - David Milec; Vojtech Kovarík; Viliam Lisý (AAMAS, 2025)