Infiltration games on arbitrary graphs

DOI10.1016/0022-247X(92)90295-OzbMath0784.90112OpenAlexW1995830743MaRDI QIDQ1191856

Steven Alpern

Publication date: 27 September 1992

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(92)90295-o

zbMATH Keywords

graphvalueinfiltration gamerestricted game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Related Items (7)

Infrastructure security games ⋮ Optimizing periodic patrols against short attacks on the line and other networks ⋮ Weighted search games ⋮ On the infiltration game ⋮ Patrolling a perimeter ⋮ Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder ⋮ Static search games played over graphs and general metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Markov chain game with dynamic information
• About when to use the searchlight
• Search games
• A basic searchlight game
• Parallel concepts in graph theory

This page was built for publication: Infiltration games on arbitrary graphs