A gold-mining problem. Optimal backup strategy in computer programs

DOI10.1017/S0269964800142020MaRDI QIDQ2711571zbMATH OpenOpenAlexFDO

Authors Minoru Sakaguchi, Toshio Hamada

Publication date 2000

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964800142020

zbMATH Keywords

dynamic programminggold-mining problemsequential strategy

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15) Dynamic programming (90C39)

Review text

This paper offers another approach to the problem of finding an optimal sequential backup strategy tackled by the second author [J. Oper. Res. Soc. Japan 42, 457--470 (1999; Zbl 0998.90083)]. This problem, related to a programming job on a computer, can also be viewed as a special case of R. Bellman's gold-mining problem (1957) approached initially by dynamic programming. The authors derive an optimal strategy and next extend their methodology to cover the case when probability parameter \(p\) is unknown by means of a Bayesian approach.

Recommendations

• Optimal sequential backup strategy under constrained resources
• OPTIMAL BACKUP STRATEGY FOR MAKING FILES BY COMPUTER
• Optimal sequential file search
• Optimal sequential file search: A reduced-state dynamic programming approach
• A note on an optimal choice problem

Cited in

(1)

• Using Jason to Implement a Team of Gold Miners

This page was built for publication: A gold-mining problem. Optimal backup strategy in computer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2711571)