A Proof of the Bomber Problem's Spend-It-All Conjecture

Details A Proof of the Bomber Problem's Spend-It-All Conjecture A Proof of the Bomber Problem's Spend-It-All Conjecture

2011-03-01

arxiv.org/abs/1103.0309v1

Sequential Analysis vol. 30 (2011) p. 52-57

Mathematics

Probability

Scientific paper

The Bomber Problem concerns optimal sequential allocation of partially effective ammunition $x$ while under attack from enemies arriving according to a Poisson process over a time interval of length $t$. In the doubly-continuous setting, in certain regions of $(x,t)$-space we are able to solve the integral equation defining the optimal survival probability and find the optimal allocation function $K(x,t)$ exactly in these regions. As a consequence, we complete the proof of the "spend-it-all" conjecture of Bartroff et al. (2010b) which gives the boundary of the region where $K(x,t)=x$.

Affiliated with

Also associated with

No associations

Rating

A Proof of the Bomber Problem's Spend-It-All Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Proof of the Bomber Problem's Spend-It-All Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Proof of the Bomber Problem's Spend-It-All Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472606