Abstract:
The classical Germeier's attack–defense game is generalized for the case of defense in depth (multilayered defense) that has a network structure. The generalization is based on the work by Hohzaki and Tanaka. In distinction from this work, the defense in each possible direction of motion between the network nodes given by directed arcs may have multiple layers, which leads in the general case to convex minimax problems that can be solved using the subgradient descent method. In particular, the proposed model generalizes the classical attack–defense model for the multilayered defense without the simplifying assumption that the effectiveness of defense is independent of the defense layer.
Key words:classical Germeier’s attack–defense game, multilayered and network generalization, the best guaranteed result of defense, minimax defense strategy, mixed attack strategy.
References