New results on a stochastic duel game with each force consisting of heterogeneous units
Lin, Kyle Y.
MetadataShow full item record
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, in order to maximize the probability of wiping out the opposing force before getting wiped out. It has been shown in the literature that anoptimal pure strategy exists for this two-person, zero-sum game, but computing the optimal strategy 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.
NPS Report NumberNPS-OR-13-002
Showing items related by title, author, creator and subject.
Choe, Jum Soo (1983-03);This paper provides the conceptual foundation for stochastic-duels and then develops a modest extension to more realistic combat situations. Simple Stochastic models for the fundamental duel and the classical duel are ...
Gaver, Donald Paul (Monterey, California. Naval Postgraduate School, 1998-08-01); NPS-OR-98-005Mathematical models are furnished for a situation in which Red missile-shooting air defense forces engage attacking Blue striking aircraft. Red may either employ extensive electronic emissions when firing at Blue, which ...