People

RESEARCHERS & LECTURERS

DOC. MGR. VILIAM LISÝ, MSC., PH.D.

doc. Mgr. Viliam Lisý, MSc., Ph.D.
Praha 2, Karlovo náměstí 13, E-407
+420 224 357 581
lisyvili@fel.cvut.cz

Theses topics
  • Game Theory:
    • Game Theory
  • Cybersecurity:
    • Network Security
  • Machine Learning:
    • Machine Learning

Lisý, V. 2018 Game theory: from poker to network security, detail

Safavi-Naini, R., Poostindouz, A., Lisý, V. 2018 Path Hopping: An MTD Strategy for Long-Term Quantum-Safe Communication, detail

Č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

Safavi-Naini, R., Lisý, V., Desmedt, Y.G. 2017 Economically Optimal Variable Tag Length Message Authentication, detail

Safavi-Naini, R., Poostindouz, A., Lisý, V. 2017 Path Hopping: an MTD Strategy for Quantum-safe Communication, detail

Janisch, J., Pevný, T., Lisý, V. 2017 Classification with Costly Features using Deep Reinforcement Learning, detail

Moravčík, M., Schmid, M., Burch, N., Lisý, V. 2017 DeepStack: Expert-level artificial intelligence in heads-up no-limit poker, 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

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

Lisý, V., Bowling, M. 2017 Eqilibrium Approximation Quality of Current No-Limit Poker Bots, 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

Č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

Lisý, V., Davis, T, Bowling, M. 2016 Counterfactual Regret Minimization in Sequential Security 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

Lisý, V., Yee, T., Bowling, M. 2016 Monte carlo tree search in continuous action spaces with execution uncertainty, detail

Lisý, V., Lanctot, M., Bowling, M. 2015 Online Monte Carlo Counterfactual Regret Minimization for Search in Imperfect Information Games, detail

Klíma, R., Lisý, V., Kiekintveld, Ch. 2015 Combining online learning and equilibrium computation in security games, detail

Kiekintveld, C., Lisý, V., Píbil, R. 2015 Game-Theoretic Foundations for the Strategic Use of Honeypots in Network Security, detail

Kiekintveld, C., Lisý, V., Píbil, R. 2015 Game-theoretic Foundations for the Strategic Use of Honeypots in Network Security, 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., Lisý, V. 2014 Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games, detail

Durkota, K., Lisý, V. 2014 Computing Optimal Policies for Attack Graphs with Action Failures and Costs, detail

Lisý, V., Kessl, R., Pevný, T. 2014 Randomized Operating Point Selection in Adversarial Classification, detail

Lanctot, M., Lisý, V., Winands, M.H.M. 2014 Monte Carlo Tree Search in Simultaneous Move Games with Applications to Goofspiel, detail

Lisý, V. 2014 ALTERNATIVE SELECTION FUNCTIONS FOR INFORMATION SET MONTE CARLO TREE SEARCH, 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

Klíma, R., Kiekintveld, Ch., Lisý, V. 2014 Online Learning Methods for Border Patrol Resource Allocation, detail

Lanctot, M., Lisý, V., Bowling, M. 2014 Search in Imperfect Information Games Using Online Monte Carlo Counterfactual Regret Minimization, detail

Lisý, V., Píbil, R. 2013 Computing Optimal Attack Strategies Using Unconstrained Influence Diagrams, 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

Vaněk, O., Bošanský, B., Jakob, M., Lisý, V., Pěchouček, M. 2012 Extending Security Games to Defenders with Constrained Mobility, 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., 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

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

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

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. 2010 Planning and Decision-Making in Complex Dynamic Adversarial Domains, detail

Lisý, V., Zivan, R., Sycara, K., Pěchouček, M. 2010 Deception in Networks of Mobile Sensing Agents, detail

Lisý, V. 2010 Adversarial Planning for Large Multi-agent Simulations, detail

van den Broek, E.L., Lisý, V., Westerink, J.H.D.M., Schut, M.H., Tuinenbreijer, K. 2010 Affective Man-Machine Interface: Unveiling Human Emotions through Biosignals, detail

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

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

Lisý, V., Jakob, M., Benda, P., Urban, Š., Pěchouček, M. 2009 Towards Cooperative Predictive Data Mining in Competitive Environments., 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

van den Broek, E., Lisý, V., Westerink, J.H.D., Schut, M.H., Tuinenbreijer, K. 2009 Biosignals as an Advanced Man-Machine Interface, detail

Lisý, V., Jakob, M., Tožička, J., Pěchouček, M. 2008 Utility-based Model for Classifying Adversarial Behaviour in Multi-Agent Systems, detail