Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-18T01:24:01.734Z Has data issue: false hasContentIssue false
  • English
  • Français

On optimal allocation of a continuous resource using an iterative approach and total positivity

Part of: Sequential methods Game theory Stochastic processes

Published online by Cambridge University Press:  01 July 2016

Jay Bartroff ,
Larry Goldstein ,
Yosef Rinott  and
Ester Samuel-Cahn
Jay Bartroff*
Affiliation:
University of Southern California
Larry Goldstein*
Affiliation:
University of Southern California
Yosef Rinott*
Affiliation:
The Hebrew University of Jerusalem
Ester Samuel-Cahn*
Affiliation:
The Hebrew University of Jerusalem
*
∗ Postal address: Department of Mathematics, University of Southern California, 1042 West 36th Place, Los Angeles, CA 90089-1113, USA.
∗ Postal address: Department of Mathematics, University of Southern California, 1042 West 36th Place, Los Angeles, CA 90089-1113, USA.
∗∗ Postal address: Department of Statistics and Center for the Study of Rationality, The Hebrew University of Jerusalem, Jerusalem, 91905, Israel.
∗∗ Postal address: Department of Statistics and Center for the Study of Rationality, The Hebrew University of Jerusalem, Jerusalem, 91905, Israel.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We study a class of optimal allocation problems, including the well-known bomber problem, with the following common probabilistic structure. An aircraft equipped with an amount x of ammunition is intercepted by enemy airplanes arriving according to a homogeneous Poisson process over a fixed time duration t. Upon encountering an enemy, the aircraft has the choice of spending any amount 0 ≤ y ≤ x of its ammunition, resulting in the aircraft's survival with probability equal to some known increasing function of y. Two different goals have been considered in the literature concerning the optimal amount K(x, t) of ammunition spent: (i) maximizing the probability of surviving for time t, which is the so-called bomber problem; and (ii) maximizing the number of enemy airplanes shot down during time t, which we call the fighter problem. Several authors have attempted to settle the following conjectures about the monotonicity of K(x, t): (A) K(x, t) is decreasing in t; (B) K(x, t) is increasing in x; and (C) the amount x - K(x, t) held back is increasing in x. Conjectures (A) and (C) have been shown for the bomber problem with discrete ammunition, while (B) is still an open question. In this paper we consider both time and ammunition to be continuous, and, for the bomber problem, we prove (A) and (C), while, for the fighter problem, we prove (A) and (C) for one special case and (B) and (C) for another. These proofs involve showing that the optimal survival probability and optimal number shot down are totally positive of order 2 (TP2) in the bomber and fighter problems, respectively. The TP2 property is shown by constructing convergent sequences of approximating functions through an iterative operation which preserves TP2 and other properties.

Keywords

Bomber problemlog-concaveoptimal allocationsequential optimizationtotal positivity

MSC classification

Primary: 60G40: Stopping times; optimal stopping problems; gambling theory
Secondary: 62L05: Sequential design 91A60: Probabilistic games; gambling
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 42 , Issue 3 , September 2010 , pp. 795 - 815
Copyright
Copyright © Applied Probability Trust 2010 

References

Bartroff, J., Goldstein, L. and Samuel-Cahn, E. (2010). The spend-it-all region and small time results for the continuous bomber problem. Sequent. Anal. 29, 275–291.CrossRefGoogle Scholar
Karlin, S. (1968). Total Positivity, Vol. I. Stanford University Press.Google Scholar
Klinger, A. and Brown, T. A. (1968). Allocating unreliable units to random demands. In Stochastic Optimization and Control (Proc. Adv. Seminar, Madison, Wisconsin, 1967), ed. Karreman, H. F., John Wiley, New York, pp. 173–209.Google Scholar
Luenberger, D. G. (1969). Optimization by Vector Space Methods. John Wiley, New York.Google Scholar
Prékopa, A. (1973). On logarithmic concave measures and functions. Acta Sci. Math. 34, 335–343.Google Scholar
Samuel, E. (1970). On some problems in operations research. J. Appl. Prob. 7, 157–164.CrossRefGoogle Scholar
Schoenberg, I. J. (1951). On Pólya frequency functions. I. The totally positive functions and their Laplace transforms. J. Analyse Math. 1, 331–374.CrossRefGoogle Scholar
Shepp, L. A., Simons, G. and Yao, Y.-C. (1991). On a problem of ammunition rationing. Adv. Appl. Prob. 23, 624–641.CrossRefGoogle Scholar
Simons, G. and Yao, Y.-C. (1990). Some results on the bomber problem. Adv. Appl. Prob. 22, 412–432.CrossRefGoogle Scholar
Weber, R. (1985). On a problem of ammunition rationing. In Stochastic Dynamic Optimization and Applications in Scheduling and Related Areas, Universität Passau, p. 148.Google Scholar