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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.