The integer Prim-Read deployment and firing schedule problem for a point defense was solved by Burr, Falk, and Karr in 1985. This paper investigates the consequences if the offense cannot acquire reliable knowledge of the firing schedules of the defense. The problem is readily formulated as a two-person zero-sum game in normal form in which the payoff is the average return. The paper also establishes a relationship between this average return game and the "constrained offense game" in which the offense and defense attempt to maximize and minimize total damage, subject to an explicit upper limit on the attack size against a set of many identical targets. This result extends to other closely related problems. Examples are given of other offense-defense situations for which a game-theoretic approach is called for even if other approximate approaches must be used in practice.
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.