A Proof of the Bomber Problem's Spend-It-All Conjecture
From MaRDI portal
Publication:3083471
DOI10.1080/07474946.2011.539920zbMath1210.60041arXiv1103.0309OpenAlexW2963642930WikidataQ123022908 ScholiaQ123022908MaRDI QIDQ3083471
Publication date: 21 March 2011
Published in: Sequential Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.0309
Stopping times; optimal stopping problems; gambling theory (60G40) Sequential statistical design (62L05) Probabilistic games; gambling (91A60)
Related Items
ABCs of the bomber problem and its relatives, The fighter problem: optimal allocation of a discrete commodity, The Spend-It-All Region and Small Time Results for the Continuous Bomber Problem
Cites Work