default search action
Viliam Lisý
Person information
- affiliation: CTU in Prague
- affiliation: University of Alberta
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j15]Jaromír Janisch
, Tomás Pevný, Viliam Lisý:
Classification with costly features in hierarchical deep sets. Mach. Learn. 113(7): 4487-4522 (2024) - [c53]David Milec, Ondrej Kubícek, Viliam Lisý:
Continual Depth-limited Responses for Computing Counter-strategies in Sequential Games. AAMAS 2024: 2393-2395 - [c52]Ondrej Kubícek, Neil Burch, Viliam Lisý:
Look-ahead Search on Top of Policy Networks in Imperfect Information Games. IJCAI 2024: 4344-4352 - [i27]Branislav Bosanský, Lada Hospodkova, Michal Najman, Maria Rigaki, Elnaz Babayeva, Viliam Lisý:
Counteracting Concept Drift by Learning with Future Malware Predictions. CoRR abs/2404.09352 (2024) - 2023
- [j14]Vojtech Kovarík
Value functions for depth-limited solving in zero-sum imperfect-information games. Artif. Intell. 314: 103805 (2023) - [c51]Jaromír Janisch
NASimEmu: Network Attack Simulator & Emulator for Training Agents Generalizing to Novel Scenarios. ESORICS Workshops (2) 2023: 589-608 - [c50]Vojtech Kovarík, Martin Schmid, Neil Burch, Michael Bowling, Viliam Lisý:
Rethinking Formal Models of Partially Observable Multiagent Decision Making (Extended Abstract). IJCAI 2023: 6920-6924 - [i26]Jaromír Janisch, Tomás Pevný, Viliam Lisý:
NASimEmu: Network Attack Simulator & Emulator for Training Agents Generalizing to Novel Scenarios. CoRR abs/2305.17246 (2023) - [i25]David Milec, Viliam Lisý, Christopher Kiekintveld:
Generation of Games for Opponent Model Differentiation. CoRR abs/2311.16781 (2023) - [i24]Ondrej Kubícek, Neil Burch, Viliam Lisý:
Look-ahead Search on Top of Policy Networks in Imperfect Information Games. CoRR abs/2312.15220 (2023) - 2022
- [j13]Vojtech Kovarík
Rethinking formal models of partially observable multiagent decision making. Artif. Intell. 303: 103645 (2022) - [j12]Simon Mandlík, Matej Racinsky, Viliam Lisý, Tomás Pevný:
JsonGrinder.jl: automated differentiable neural architecture for embedding arbitrary JSON data. J. Mach. Learn. Res. 23: 298:1-298:5 (2022) - [i23]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) - [i22]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
- [c49]Jakub Cerný, Viliam Lisý, Branislav Bosanský, Bo An:
Computing Quantal Stackelberg Equilibrium in Extensive-Form Games. AAAI 2021: 5260-5268 - [c48]David Milec
Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games. AAAI 2021: 5575-5583 - [i21]Michael Walton, Viliam Lisý:
Multi-agent Reinforcement Learning in OpenSpiel: A Reproduction Report. CoRR abs/2103.00187 (2021) - [i20]Simon Mandlík, Matej Racinsky, Viliam Lisý, Tomás Pevný:
Mill.jl and JsonGrinder.jl: automated differentiable feature extraction for learning from raw JSON data. CoRR abs/2105.09107 (2021) - [i19]Marek Galovic, Branislav Bosanský, Viliam Lisý:
Improving Robustness of Malware Classifiers using Adversarial Strings Generated from Perturbed Latent Representations. CoRR abs/2110.11987 (2021) - [i18]Vojtech Kovarík, David Milec, Michal Sustr, Dominik Seitz, Viliam Lisý:
Fast Algorithms for Poker Require Modelling it as a Sequential Bayesian Game. CoRR abs/2112.10890 (2021) - [i17]David Milec, Viliam Lisý:
Continual Depth-limited Responses for Computing Counter-strategies in Extensive-form Games. CoRR abs/2112.12594 (2021) - 2020
- [j11]Jirí Cermák, Viliam Lisý, Branislav Bosanský:
Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games. Artif. Intell. 282: 103248 (2020) - [j10]Vojtech Kovarík
Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games. Mach. Learn. 109(1): 1-50 (2020) - [j9]Jaromír Janisch
Classification with costly features as a sequential decision-making problem. Mach. Learn. 109(8): 1587-1615 (2020) - [c47]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 - [c46]Jakub Cerný, Viliam Lisý, Branislav Bosanský, Bo An:
Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium. IJCAI 2020: 246-253 - [c45]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 - [i16]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) - [i15]Jaromír Janisch, Tomás Pevný, Viliam Lisý:
Symbolic Relational Deep Reinforcement Learning based on Graph Neural Networks. CoRR abs/2009.12462 (2020) - [i14]David Milec, Jakub Cerný, Viliam Lisý, Bo An:
Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games. CoRR abs/2009.14521 (2020)
2010 – 2019
- 2019
- [j8]Karel Durkota, Viliam Lisý, Branislav Bosanský, Christopher Kiekintveld, Michal Pechoucek
Hardening networks against strategic attackers using attack graph games. Comput. Secur. 87 (2019) - [c44]Jaromír Janisch, Tomás Pevný, Viliam Lisý:
Classification with Costly Features Using Deep Reinforcement Learning. AAAI 2019: 3959-3966 - [c43]Michal Sustr, Vojtech Kovarík, Viliam Lisý:
Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games. AAMAS 2019: 224-232 - [i13]Vojtech Kovarík, Viliam Lisý:
Problems with the EFG formalism: a solution attempt using observations. CoRR abs/1906.06291 (2019) - [i12]Vojtech Kovarík, Viliam Lisý:
Value Functions for Depth-Limited Solving in Zero-Sum Imperfect-Information Games. CoRR abs/1906.06412 (2019) - [i11]Vojtech Kovarík, Martin Schmid, Neil Burch, Michael Bowling, Viliam Lisý:
Rethinking Formal Models of Partially Observable Multiagent Decision Making. CoRR abs/1906.11110 (2019) - [i10]Jaromír Janisch, Tomás Pevný, Viliam Lisý:
Classification with Costly Features as a Sequential Decision-Making Problem. CoRR abs/1909.02564 (2019) - [i9]Jaromír Janisch, Tomás Pevný, Viliam Lisý:
Deep Reinforcement Learning with Explicitly Represented Knowledge and Variable State and Action Spaces. CoRR abs/1911.08756 (2019) - 2018
- [j7]Jirí Cermák, Branislav Bosanský, Karel Horák, Viliam Lisý
Approximating maxmin strategies in imperfect recall games using A-loss recall property. Int. J. Approx. Reason. 93: 290-326 (2018) - [j6]Reihaneh Safavi-Naini
Path Hopping: An MTD Strategy for Long-Term Quantum-Safe Communication. Secur. Commun. Networks 2018: 8475818:1-8475818:15 (2018) - [i8]Jiri Cermak, Viliam Lisý, Branislav Bosanský:
Constructing Imperfect Recall Abstractions to Solve Large Extensive-Form Games. CoRR abs/1803.05392 (2018) - [i7]Vojtech Kovarík, Viliam Lisý:
Analysis of Hannan Consistent Selection for Monte Carlo Tree Search in Simultaneous Move Games. CoRR abs/1804.09045 (2018) - [i6]Michal Sustr, Vojtech Kovarík, Viliam Lisý:
Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games. CoRR abs/1812.07351 (2018) - 2017
- [j5]Monica Anderson
Reports of the Workshops of the Thirty-First AAAI Conference on Artificial Intelligence. AI Mag. 38(3): 72-82 (2017) - [c42]Viliam Lisý, Michael Bowling:
Eqilibrium Approximation Quality of Current No-Limit Poker Bots. AAAI Workshops 2017 - [c41]Reihaneh Safavi-Naini, Alireza Poostindouz, Viliam Lisý:
Path Hopping: an MTD Strategy for Quantum-safe Communication. MTD@CCS 2017: 111-114 - [c40]Reihaneh Safavi-Naini, Viliam Lisý, Yvo Desmedt:
Economically Optimal Variable Tag Length Message Authentication. Financial Cryptography 2017: 204-223 - [c39]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 - [c38]Jiri Cermak, Branislav Bosanský, Viliam Lisý:
An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games. IJCAI 2017: 936-942 - [i5]Matej Moravcík, Martin Schmid, Neil Burch, Viliam Lisý, Dustin Morrill, Nolan Bard, Trevor Davis, Kevin Waugh, Michael Johanson, Michael H. Bowling:
DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker. CoRR abs/1701.01724 (2017) - [i4]Jaromír Janisch, Tomás Pevný, Viliam Lisý:
Classification with Costly Features using Deep Reinforcement Learning. CoRR abs/1711.07364 (2017) - 2016
- [j4]Branislav Bosanský, Viliam Lisý
Algorithms for computing strategies in two-player simultaneous move games. Artif. Intell. 237: 1-40 (2016) - [j3]Stefano V. Albrecht, Bruno Bouchard, John S. Brownstein, David L. Buckeridge, Cornelia Caragea
Reports of the 2016 AAAI Workshop Program. AI Mag. 37(3): 99-108 (2016) - [j2]Karel Durkota, Viliam Lisý
Case Studies of Network Defense with Attack Graph Games. IEEE Intell. Syst. 31(5): 24-30 (2016) - [c37]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 - [c36]Viliam Lisý, Trevor Davis, Michael H. Bowling:
Counterfactual Regret Minimization in Sequential Security Games. AAAI 2016: 544-550 - [c35]Timothy Yee, Viliam Lisý, Michael H. Bowling:
Monte Carlo Tree Search in Continuous Action Spaces with Execution Uncertainty. IJCAI 2016: 690-697 - [e1]Viliam Lisý, Michael Thielscher, Thanh Nguyen:
Computer Poker and Imperfect Information Games, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 13, 2016. AAAI Technical Report WS-16-06, AAAI Press 2016 [contents] - [i3]Viliam Lisý, Michael H. Bowling:
Eqilibrium Approximation Quality of Current No-Limit Poker Bots. CoRR abs/1612.07547 (2016) - 2015
- [c34]Viliam Lisý, Marc Lanctot, Michael H. Bowling:
Online Monte Carlo Counterfactual Regret Minimization for Search in Imperfect Information Games. AAMAS 2015: 27-36 - [c33]Karel Durkota, Viliam Lisý, Christopher Kiekintveld, Branislav Bosanský:
Game-Theoretic Algorithms for Optimal Network Security Hardening Using Attack Graphs. AAMAS 2015: 1773-1774 - [c32]Richard Klíma, Viliam Lisý
Combining Online Learning and Equilibrium Computation in Security Games. GameSec 2015: 130-149 - [c31]Karel Durkota, Viliam Lisý
Approximate Solutions for Attack Graph Games with Imperfect Information. GameSec 2015: 228-249 - [c30]Karel Durkota, Viliam Lisý, Branislav Bosanský, Christopher Kiekintveld:
Optimal Network Security Hardening Using Attack Graph Games. IJCAI 2015: 526-532 - [p1]Christopher Kiekintveld, Viliam Lisý
Game-Theoretic Foundations for the Strategic Use of Honeypots in Network Security. Cyber Warfare 2015: 81-101 - [i2]Vojtech Kovarík, Viliam Lisý:
Analysis of Hannan Consistent Selection for Monte Carlo Tree Search in Simultaneous Move Games. CoRR abs/1509.00149 (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) - [c29]Jirí Cermák, Branislav Bosanský, Viliam Lisý
Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games. ECAI 2014: 201-206 - [c28]Richard Klíma, Christopher Kiekintveld, Viliam Lisý:
Online Learning Methods for Border Patrol Resource Allocation. GameSec 2014: 340-349 - [c27]Viliam Lisý
Randomized Operating Point Selection in Adversarial Classification. ECML/PKDD (2) 2014: 240-255 - [c26]Karel Durkota, Viliam Lisý
Computing Optimal Policies for Attack Graphs with Action Failures and Costs. STAIRS 2014: 101-110 - 2013
- [c25]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 - [c24]Marc Lanctot, Viliam Lisý
Monte Carlo Tree Search in Simultaneous Move Games with Applications to Goofspiel. CGW@IJCAI 2013: 28-43 - [c23]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 - [c22]Viliam Lisý, Vojtech Kovarík, Marc Lanctot, Branislav Bosanský:
Convergence of Monte Carlo Tree Search in Simultaneous Move Games. NIPS 2013: 2112-2120 - [c21]Viliam Lisý
Computing Optimal Attack Strategies Using Unconstrained Influence Diagrams. PAISI 2013: 38-46 - [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
- [c20]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 - [c19]Viliam Lisý, Branislav Bosanský, Michal Pechoucek:
Anytime algorithms for multi-agent visibility-based pursuit-evasion games. AAMAS 2012: 1301-1302 - [c18]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 - [c17]Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý
Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information. ECAI 2012: 193-198 - [c16]Viliam Lisý
Game-theoretic Approach to Adversarial Plan Recognition. ECAI 2012: 546-551 - [c15]Radek Píbil, Viliam Lisý
Game Theoretic Model of Strategic Honeypot Selection in Computer Networks. GameSec 2012: 201-220 - 2011
- [c14]Branislav Bosanský, Viliam Lisý, Michal Jakob, Michal Pechoucek:
Computing time-dependent policies for patrolling games with mobile targets. AAMAS 2011: 989-996 - [c13]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 - [c12]Branislav Bosanský, Viliam Lisý
Towards Cooperation in Adversarial Search with Confidentiality. HoloMAS 2011: 246-255 - 2010
- [c11]Viliam Lisý, Roie Zivan, Katia P. Sycara, Michal Pechoucek:
Deception in networks of mobile sensing agents. AAMAS 2010: 1031-1038 - [c10]Viliam Lisý:
Adversarial planning for large multi-agent simulations. AAMAS 2010: 1665-1666 - [c9]Viliam Lisý
Agent subset adversarial search for complex non-cooperative domains. CIG 2010: 211-218
2000 – 2009
- 2009
- [c8]Viliam Lisý
Towards Cooperative Predictive Data Mining in Competitive Environments. ADMI 2009: 95-108 - [c7]Viliam Lisý, Branislav Bosanský, Michal Jakob, Michal Pechoucek:
Adversarial search with procedural knowledge heuristic. AAMAS (2) 2009: 899-906 - [c6]Egon L. van den Broek, Viliam Lisý, Joyce H. D. M. Westerink, Marleen H. Schut, Kees Tuinenbreijer:
Biosignals as an Advanced Man-Machine Interface. BIOSTEC 2009: 15-24 - [c5]Egon L. van den Broek, Viliam Lisý
Affective Man-Machine Interface: Unveiling Human Emotions through Biosignals. BIOSTEC (Selected Papers) 2009: 21-47 - [c4]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 - [c3]Viliam Lisý
Goal-Based Game Tree Search for Complex Domains. ICAART (Revised Selected Papers) 2009: 97-109 - 2008
- [c2]Viliam Lisý
Utility-based model for classifying adversarial behaviour in multi-agent systems. IMCSIT 2008: 47-53 - 2007
- [c1]Jirí Isa, Viliam Lisý
Unconstrained Influence Diagram Solver: Guido. ICTAI (1) 2007: 24-27
Coauthor Index
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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 2024-10-21 21:30 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: