System Analysis, Control and Data Processing

The "attack-defense" model on networks with the initial residuals of the parties

A. G. Perevozchikov^a, V. Yu. Reshetov^b, A. I. Lesik<sup>c

a</sup> NPO "RusBITTech", Tver
^b Lomonosov Moscow State University, Moscow
^c Tver State University, Tver

Abstract: The article generalizes the "attack-defense" game with the network structure, in terms of accounting for the initial residuals of the parties' resources and is based on the work by Hohzaki and Tanaka. In contrast to the latter, the defense on each of the possible movement directions between the network’s vertices, given by the oriented edges, can have nonzero initial residuals of the parties' resources, which generally leads to convex minimax problems that can be solved by the subgradient descent method. In particular, the model under study generalizes the "attack-defense" game with initial residuals, proposed by Ogaryshev, to the network case.

Keywords: Germeier’s classic "attack-defense" game, Ogaryshev’s generalization, network generalization by Hohzaki and Tanaka, best guaranteed defense result, minimax defense strategy, mixed attack strategy.

UDC: 519.626

Received: 09.02.2021
Revised: 15.04.2021

DOI: 10.26456/vtpmk618

Bibliographic databases:

•