A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I

DOI10.1134/S000511792111014XzbMath1480.91043OpenAlexW4200157763MaRDI QIDQ2069711

T. T. Ibaydullaev, Abdulla A. Azamov

Publication date: 21 January 2022

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s000511792111014x

zbMATH Keywords

differential gamecomplete graphpursuit problemevasion problemgame on graph\( \Pi \)-strategyregularity coefficient of simplex

Mathematics Subject Classification ID

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

Related Items

Cops and robber game on infinite chessboard

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on a pursuit game played on graphs
• An annotated bibliography on guaranteed graph searching
• Cop-win graphs with maximum capture-time
• Lower bound for the advantage coefficient in the search problem on graphs
• The capture time of a graph
• On an alternative for pursuit-evasion games in an infinite time interval
• Spiele auf Graphen
• A search problem on graphs which generalizes some group testing problems with two defectives
• A two-person game on graphs where each player tries to encircle his opponent's men
• The pursuit-evasion game on the 1-skeleton graph of a regular polyhedron. I