Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset

DOI10.1239/jap/1371648949zbMath1301.60101OpenAlexW2146270904MaRDI QIDQ5299565

Ester Samuel-Cahn, Abba M. Krieger

Publication date: 26 June 2013

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jap/1371648949

zbMATH Keywords

dynamic allocationoptimality propertieshazard rate dominancelikelihood ratio dominancefrail fighterinvincible fighter

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Sequential statistical methods (62L99) Continuous location (90B85) Applications of game theory (91A80) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Related Items (1)

41 counterexamples to property (B) of the discrete time bomber problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• ABCs of the bomber problem and its relatives
• The fighter problem: optimal allocation of a discrete commodity
• On optimal allocation of a continuous resource using an iterative approach and total positivity
• Some results on the bomber problem
• On some problems in operations research
• On a problem of ammunition rationing

This page was built for publication: Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset