V. V. Gusev, V. V. Mazalov, “Optimal strategies in the game of patrol on a graph”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2015, Issue 2,Pages <nobr>61

This article is cited in 1 paper

Applied mathematics

Optimal strategies in the game of patrol on a graph

V. V. Gusev, V. V. Mazalov

Institute of Applied Mathematical Research of the Karelian Research Centre RAS, 11, Pushkinskaya street, Petrozavodsk, 185000, Russian Federation

Abstract: We consider the game-theoretic model of patrolling on a graph in which an attacker has $m$ time units to attack a node of the graph and the strategy of patroller is a selection of a path in the graph. The equilibrium in the zero-sum game and the mean length of the patrolling path are derived for different graphs. Bibliogr. 7. Il. 1. Table 13.

Keywords: search game, graph, patrol, attacker, optimal strategies.

UDC: 519.8

Received: February 17, 2015