A Discrete Multilevel Attack-Defense Model with Nonhomogeneous Opponent Resources
- Autores: Perevozchikov A.G.1, Reshetov V.Y.2, Yanochkin I.E.3
-
Afiliações:
- Lurye Scientific and Methodological Center for Higher-School Innovative Activity, Tver Innocenter, Tver, Russia and Faculty of Computational Mathematics and Cybernetics, Moscow State University
- Faculty of Computational Mathematics and Cybernetics, Moscow State University
- Research and Production Association “Rusbitech”
- Edição: Volume 29, Nº 2 (2018)
- Páginas: 134-145
- Seção: Article
- URL: https://journals.rcsi.science/1046-283X/article/view/247703
- DOI: https://doi.org/10.1007/s10598-018-9396-3
- ID: 247703
Citar
Resumo
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.
Sobre autores
A. 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
Autor responsável pela correspondência
Email: pere501@yandex.ru
Rússia, Moscow
V. Reshetov
Faculty of Computational Mathematics and Cybernetics, Moscow State University
Email: pere501@yandex.ru
Rússia, Moscow
I. Yanochkin
Research and Production Association “Rusbitech”
Email: pere501@yandex.ru
Rússia, Tver
Arquivos suplementares
