A SEQUENTIAL ALLOCATION GAME FOR TARGETS WITH VARYING VALUES

The two-sided competitive situation where the players allocate ordnance, subject to resource constraints and limited mission time, to attack (or defense, for the opponent player) for the targets carrying some cargo of varying values is formulated as a two-sided time-sequential zero-sum game. A system of difference equations is derived which is in theory solvable recursively and determines the optimal strategies of the players. A special case of the game is completely solved. The continuous-time version of the problem is also discussed.