LAUSR

A nonhomogeneous generalization of the “attack–defense” game is considered. A linearization method is proposed to determine the best guaranteed outcome (BGO) of defense. The linearization utilizes a decomposition of the solution in a small parameter in the neighborhood of the trivial uniform distribution of defense resources. We show that the determination of correcting perturbations to the trivial uniform allocation of defense resources is reducible to a linear program. A prototype example to construct the correcting perturbations is considered.