Many separated targets, of only a few differing values, are subject to a simultaneous attack. The area defenses considered have impact point prediction (IPP) and full coordination, or no IPP and full coordination, or no IPP and partial coordination. For a given attack, the defense wishes to allocate its interceptors to maximize the expected total survival value of the targets. For a given attack size, and with knowledge of the defense's capabilities, the offense seeks a strategy to minimize expected total survival value against best defense. This paper presents algorithms to determine optimal attack and defense strategies and the optimal value of the minmax problem, and shows how to take computational advantage of the relatively few unique target values. It also provides illustrative computational results.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.