A graph patrol problem with random attack times
From MaRDI portal
Recommendations
Cited in
(18)- Optimizing periodic patrols against short attacks on the line and other networks
- Continuous patrolling and hiding games
- Optimal patrol on a graph against random and strategic attackers
- Approximate solutions for expanding search games on general networks
- Approximation algorithms for fragmenting a graph against a stochastically-located threat
- Performance safety enforcement in stochastic event graphs against boost and slow attacks
- A Markov decision process model on dynamic routing for target surveillance
- Patrolling a border
- Patrolling a pipeline
- Optimal search and ambush for a hider who can escape the search region
- Optimal patrol to uncover threats in time when detection is imperfect
- Adversarial patrolling in a uniform
- Technical note -- Optimal patrol of a perimeter
- Continuous Patrolling Games
- Optimal patrolling strategies for trees and complete networks
- A stochastic game framework for patrolling a border
- A review of attacker-defender games: current state and paths forward
- Data-driven dynamic police patrolling: an efficient Monte Carlo tree search
This page was built for publication: A graph patrol problem with random attack times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846426)
