New results on a stochastic duel game with each force consisting of heterogeneous units |
| |
| Authors: | Kyle Y Lin |
| |
| Affiliation: | Department of Operations Research, Naval Postgraduate School, Monterey, California |
| |
| 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, in order 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 remained cumbersome because of the game's huge payoff matrix. This article gives an iterative algorithm to compute the optimal strategy without having to enumerate the entire payoff matrix, and offers some insights into the special case, where one force has only one unit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 56–65, 2014 |
| |
| Keywords: | stochastic duel two‐person zero‐sum game fire allocation
|
|
|
