79
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Rigorous Computer Analysis of the Chow–Robbins Game

&
Pages 893-900 | Published online: 13 Dec 2017

REFERENCES

  • Y.-S. Chow, H. Robbins, On optimal stopping rules for sn/n, Ill. J. Math. 9 (1965) 444–454.
  • A. Dvoretzky, Existence and properties of certain optimal stopping rules, Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, 1: 441–452. Univ. of California Press, Berkeley, CA, 1967.
  • L. A. Medina, D. Zeilberger, An Experimental Mathematics Perspective on the Old, and still Open, Question of When To Stop?, in Gems in Experimental Mathematics, Contemporary Mathematics series v. 517 (AMS), Edited by T. Amdeberhan, L. Medina, and V. Moll, 265–274, also available at arXiv: 0907.0032v2 [math.PR].
  • L. A. Shepp, Explicit solutions to some problems of optimal stopping, The Annals of Mathematical Statistics 40 (1969) 993–1010, available at http://dx.doi.org/10.1214/aoms/1177697604.
  • W. Stadje, The maximum average gain in a sequence of Bernoulli games, Amer. Math. Monthly, December (2008) 902–910.
  • J. D. A. Wiseman, The Chow & Robbins Problem: Stop at h = 5t = 3, available at http://www.jdawiseman.com/papers/easymath/chow_robbins.html.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.