On optimal allocation of a continuous resource using an iterative approach and total positivity
From MaRDI portal
Publication:3059696
DOI10.1239/aap/1282924063zbMath1229.62105arXiv1103.0308MaRDI QIDQ3059696
Yosef Rinott, Jay Bartroff, Larry Goldstein, Ester Samuel-Cahn
Publication date: 26 November 2010
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.0308
62L99: Sequential statistical methods
60G40: Stopping times; optimal stopping problems; gambling theory
62L05: Sequential statistical design
62L15: Optimal stopping in statistics
Related Items
The Spend-It-All Region and Small Time Results for the Continuous Bomber Problem, Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset, ABCs of the bomber problem and its relatives, 41 counterexamples to property (B) of the discrete time bomber problem, On the exponent of several classes of oscillatory matrices, Concavity and monotonicity properties in a groundwater management model, The fighter problem: optimal allocation of a discrete commodity, A Proof of the Bomber Problem's Spend-It-All Conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Pólya frequency functions. I. The totally positive functions and their Laplace transforms
- Some results on the bomber problem
- The Spend-It-All Region and Small Time Results for the Continuous Bomber Problem
- On some problems in operations research
- On a problem of ammunition rationing
