On a characterization of evasion strategies for pursuit-evasion games on graphs

DOI10.1007/s10957-017-1155-7zbMath1386.05117OpenAlexW2748168566MaRDI QIDQ1686676

Shravan Luckraz, Gafurjan I. Ibragimov

Publication date: 15 December 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-017-1155-7

zbMATH Keywords

games on graphsevaderpursuerevasion strategypursuit strategy

Mathematics Subject Classification ID

Discrete-time games (91A50) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (7)

Game with Slow Pursuers on the Edge Graphs of Regular Simplexes ⋮ Differential Game with Slow Pursuers on the Edge Graph of a Simplex ⋮ Cops and robber game on infinite chessboard ⋮ Unnamed Item ⋮ A survey on the relationship between the game of cops and robbers and other game representations ⋮ Some game-theoretic remarks on two-player generalized cops and robbers games ⋮ On a contraction-like property of dismantlable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• Cops and robbers in graphs with large girth and Cayley graphs
• Vertex-to-vertex pursuit in a graph
• Meyniel's conjecture on the cop number: a survey
• Pursuit-Evasion in Models of Complex Networks

This page was built for publication: On a characterization of evasion strategies for pursuit-evasion games on graphs