DeepAI AI Chat
Log In Sign Up

Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games

by   David Klaška, et al.

We design a new efficient strategy synthesis method applicable to adversarial patrolling problems on graphs with arbitrary-length edges and possibly imperfect intrusion detection. The core ingredient is an efficient algorithm for computing the value and the gradient of a function assigning to every strategy its "protection" achieved. This allows for designing an efficient strategy improvement algorithm by differentiable programming and optimization techniques. Our method is the first one applicable to real-world patrolling graphs of reasonable sizes. It outperforms the state-of-the-art strategy synthesis algorithm by a margin.


page 1

page 2

page 3

page 4


Minimizing Expected Intrusion Detection Time in Adversarial Patrolling

In adversarial patrolling games, a mobile Defender strives to discover i...

Deviator Detection under Imperfect Monitoring

Grim-trigger strategies are a fundamental mechanism for sustaining equil...

An Exact Method for Fortification Games

A fortification game (FG) is a three-level, two-player Stackelberg game,...

Integrating Real-Time Analysis With The Dendritic Cell Algorithm Through Segmentation

As an immune inspired algorithm, the Dendritic Cell Algorithm (DCA) has ...

Evolving winning strategies for Nim-like games

An evolutionary approach for computing the winning strategy for Nim-like...