A Graph Patrol Problem with Random Attack Times

DOI10.1287/opre.1120.1149zbMath1273.90228OpenAlexW2105564119MaRDI QIDQ2846426

Michael P. Atkinson, Kyle Y. Lin, Timothy H. Chung, Kevin D. Glazebrook

Publication date: 5 September 2013

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1120.1149

zbMATH Keywords

dynamic programmingsearchgroup decisions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Noncooperative games (91A10)

Related Items (12)

Optimizing periodic patrols against short attacks on the line and other networks ⋮ Patrolling a Pipeline ⋮ Technical Note—Optimal Patrol of a Perimeter ⋮ Continuous Patrolling Games ⋮ Optimal search and ambush for a hider who can escape the search region ⋮ A Markov decision process model on dynamic routing for target surveillance ⋮ Optimal patrolling strategies for trees and complete networks ⋮ A stochastic game framework for patrolling a border ⋮ Patrolling a Border ⋮ Continuous patrolling and hiding games ⋮ Approximate solutions for expanding search games on general networks ⋮ Adversarial Patrolling in a Uniform

This page was built for publication: A Graph Patrol Problem with Random Attack Times