A Discrete Multilevel Attack-Defense Model with Nonhomogeneous Opponent Resources


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

The article generalizes Germeier’s attack-defense model to allow for integer-valued and nonhomogeneous opponent resources and echeloned defense. It performs target allocation by solving the classical transportation problem on each level, which leads to discrete minimax problems for the best guaranteed defense outcome. These minimax problems can be solved by a coordinatewise-descent method based on a discrete analogue of Germeier’s equalization principle.

About the authors

A. G. Perevozchikov

Lurye Scientific and Methodological Center for Higher-School Innovative Activity, Tver Innocenter, Tver, Russia and Faculty of Computational Mathematics and Cybernetics, Moscow State University

Author for correspondence.
Email: pere501@yandex.ru
Russian Federation, Moscow

V. Yu. Reshetov

Faculty of Computational Mathematics and Cybernetics, Moscow State University

Email: pere501@yandex.ru
Russian Federation, Moscow

I. E. Yanochkin

Research and Production Association “Rusbitech”

Email: pere501@yandex.ru
Russian Federation, Tver

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Springer Science+Business Media, LLC, part of Springer Nature