Patrolling a perimeter
From MaRDI portal
Publication:1926970
DOI10.1016/j.ejor.2012.05.030zbMath1253.91029MaRDI QIDQ1926970
Procopio Zoroa, Noemí Zoroa, María-José Fernández-Sáez
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.05.030
90B40: Search theory
91A05: 2-person games
91A80: Applications of game theory
91A24: Positional games (pursuit and evasion, etc.)
Related Items
Adversarial Patrolling in a Uniform, Technical Note—Optimal Patrol of a Perimeter, Continuous Patrolling Games, Optimal patrolling strategies for trees and complete networks, A multi-criteria police districting problem for the efficient and effective design of patrol sector, Optimal search and ambush for a hider who can escape the search region, Multithreat multisite protection: a security case study, Ambush and active search in multistage predator-prey interactions, Optimizing periodic patrols against short attacks on the line and other networks, On the approximation ratio of the random Chinese postman tour for network search, Continuous patrolling and hiding games, A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs, Risk-averse stochastic path detection, Static search games played over graphs and general metric spaces, Patrolling a Border, Tools to Manage Search Games on Lattices, The Cardinality of the Sets Involved in Lattice Games
Cites Work
- Unnamed Item
- Unnamed Item
- An inspection game with multiple inspectees
- Game theoretic risk analysis of security threats
- Infiltration games on arbitrary graphs
- Handbook of game theory with economic applications. Vol. 3
- On the infiltration game
- The theory of search games and rendezvous.
- Search games and other applications of game theory
- A generalization of Ruckle's results for an ambush game
- Weighted search games
- New results on a Ruckle problem in discrete games of ambush
- Patrolling Games
- Network search games, with arbitrary searcher starting point
- The discrete evasion game with three-move lag
- The search value of a network
- On a ruckle problem in discrete games of ambush
- Discretization of the continuous ambush game
- A search game on a cyclic graph
- Some games of search on a lattice
- An Ambush Game with an Unknown Number of Infiltrators
