Pages that link to "Item:Q1761280"
From MaRDI portal
The following pages link to Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder (Q1761280):
Displayed 17 items.
- Infrastructure security games (Q297288) (← links)
- Optimizing periodic patrols against short attacks on the line and other networks (Q1631529) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- Continuous patrolling and hiding games (Q1735165) (← links)
- A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs (Q1735189) (← links)
- Adiabatic quantum games and phase-transition-like behavior between optimal strategies (Q1993763) (← links)
- A dynamic extremum seeking scheme for three-player attack-defense with unknown gradient (Q2071211) (← links)
- Multi-robot adversarial patrolling strategies via lattice paths (Q2082517) (← links)
- Multi-robot adversarial patrolling: handling sequential attacks (Q2321301) (← links)
- Static search games played over graphs and general metric spaces (Q2356189) (← links)
- Adversarial patrolling with spatially uncertain alarm signals (Q2407886) (← links)
- Patrolling a Border (Q2957456) (← links)
- Patrolling a Pipeline (Q3179196) (← links)
- Adversarial Patrolling in a Uniform (Q5031004) (← links)
- Technical Note—Optimal Patrol of a Perimeter (Q5058049) (← links)
- Continuous Patrolling Games (Q5060487) (← links)
- A two‐stage network interdiction‐monitoring game (Q6179685) (← links)