A Discrete Multilevel Attack-Defense Model with Nonhomogeneous Opponent Resources

Аннотация

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.