A game solution to the problem of scheduling missile launchings from bases that may come under enemy attack. Both sides, Blue and Red, know each other's initial missile strength at the outbreak of atomic war between the two countries. Blue wants to maximize and Red wants to minimize the expected number of successful Blue launchings. The problem is solved first for the case of a single launching site and then for a generalization to any number of sites. It is assumed that Blue must launch his missiles within a certain time period after the outbreak of war, that each Blue site can launch only one missile at a time, and that any Blue missile being launched will be destroyed if a Red missile hits near the launch site.
This report is part of the RAND Corporation research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.
Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.
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.