From post

A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games.

, и . GameSec, том 9996 из Lecture Notes in Computer Science, стр. 435-454. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium., , , и . IJCAI, стр. 246-253. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Avast-CTU Public CAPE Dataset., , , , , , и . CoRR, (2022)An Algorithm for Constructing and Solving Imperfect Recall Abstractions of Large Extensive-Form Games., , и . IJCAI, стр. 936-942. ijcai.org, (2017)Solving adversarial patrolling games with bounded error: (extended abstract)., , , , , и . AAMAS, стр. 1617-1618. IFAAMAS/ACM, (2014)When Players Affect Target Values: Modeling and Solving Dynamic Partially Observable Security Games., , , и . GameSec, том 11836 из Lecture Notes in Computer Science, стр. 542-562. Springer, (2019)Goal-Based Game Tree Search for Complex Domains., , , и . ICAART (Revised Selected Papers), том 67 из Communications in Computer and Information Science, стр. 97-109. Springer, (2009)Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games., , , , и . AAMAS, стр. 335-342. IFAAMAS, (2013)Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall., , , и . ICAART (2), стр. 63-74. SciTePress, (2017)A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games., и . GameSec, том 9996 из Lecture Notes in Computer Science, стр. 435-454. Springer, (2016)Optimal Network Security Hardening Using Attack Graph Games., , , и . IJCAI, стр. 526-532. AAAI Press, (2015)