Accession Number : ADA576474


Title :   New Results on a Stochastic Duel Game with Each Force Consisting of Heterogeneous Units


Descriptive Note : Technical rept.


Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF OPERATIONS RESEARCH


Personal Author(s) : Lin, Kyle Y


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a576474.pdf


Report Date : Feb 2013


Pagination or Media Count : 25


Abstract : Two forces engage in a duel, with each force initially consisting of several heterogeneous units. Each unit can be assigned to fire at any opposing unit, but the kill rate depends on the assignment. As the duel proceeds, each force -- knowing which units are still alive in real time -- decides dynamically how to assign its fire, to maximize the probability of wiping out the opposing force before getting wiped out. It has been shown in the literature that an optimal pure strategy exists for this two-person zero-sum game, but computing the optimal strategy has remained cumbersome because of the game's huge payoff matrix. This paper gives an efficient algorithm to compute the optimal strategy without enumerating the entire payoff matrix, and offers some insights into the special case, when one force has only one unit.


Descriptors :   *ALLOCATIONS , *FIREPOWER , *KILL PROBABILITIES , *OPTIMIZATION , *STOCHASTIC PROCESSES , *WAR GAMES , ALGORITHMS , COMBAT SIMULATION , COMPUTER GAMES , FIRING RATE , HETEROGENEITY , KILLING


Subject Categories : Statistics and Probability
      Operations Research
      Computer Programming and Software
      Military Operations, Strategy and Tactics


Distribution Statement : APPROVED FOR PUBLIC RELEASE