All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F20%3A00341727" target="_blank" >RIV/68407700:21230/20:00341727 - isvavai.cz</a>

  • Result on the web

    <a href="https://aaai.org/ocs/index.php/SOCS/SOCS20/paper/view/18514" target="_blank" >https://aaai.org/ocs/index.php/SOCS/SOCS20/paper/view/18514</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions

  • Original language description

    Effective and efficient reasoning in adversarial environments is important for many real-world applications ranging from cybersecurity to military operations. Deliberative reasoning techniques, such as Automated Planning, often restrict to static environments where only an agent can make changes by its actions. On the other hand, such techniques are effective and can generate non-trivial solutions. To explicitly reason in environments with an active adversary such as zero-sum games, the game-theoretic framework such as the Double Oracle algorithm can be leveraged. In this paper, we leverage the notions of critical and adversary actions, where critical actions should be applied before the adversary ones. We propose heuristics that provide a guidance for planners about what (critical) actions and in which order have to be applied in a good plan. We empirically evaluate our approach in terms of quality of generated strategies (by leveraging Double Oracle) and CPU time required to generated such strategies.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the Twelfth International Symposium on Combinatorial Search

  • ISBN

    978-1-57735-822-0

  • ISSN

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    20-28

  • Publisher name

    AAAI Press

  • Place of publication

    Menlo Park

  • Event location

    Vídeň

  • Event date

    May 26, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article