Portal de Periódicos da CAPES

On a problem of ammunition rationing

1991; Cambridge University Press; Volume: 23; Issue: 3 Linguagem: Inglês

10.2307/1427626

1475-6064

Lawrence A. Shepp, Gordon Simons, Yi‐Ching Yao,

Artificial Intelligence in Games

Suppose you have u units of ammunition and want to destroy as many as possible of a sequence of attacking enemy aircraft. If you fire v = v ( u ), 0 , units of your ammunition at the first enemy, it survives with probability q v , where 0 < q < 1 is given, and then kills you. With the complementary probability, 1 – q v , you destroy the aircraft and you live to face the next enemy with only u – v units of ammunition remaining. It seems almost obvious that any strategy which maximizes the expected number of enemies destroyed before you die will fire more units at the first enemy as u increases, i.e., it seems obvious that v′ ( u ) 0 under optimal play. We show this to be false, thereby disproving an appealing conjecture proposed by Weber. We also consider a variant of this problem and find that the counterpart of Weber's conjecture holds in some cases.