Rigorous computer analysis of the Chow-Robbins game

Details Rigorous computer analysis of the Chow-Robbins game Rigorous computer analysis of the Chow-Robbins game

2012-01-03

arxiv.org/abs/1201.0626v1

Mathematics

Probability

10 pages

Scientific paper

Flip a coin repeatedly, and stop whenever you want. Your payoff is the proportion of heads, and you wish to maximize this payoff in expectation. This so-called Chow-Robbins game is amenable to computer analysis, but while simple-minded number crunching can show that it is best to continue in a given position, establishing rigorously that stopping is optimal seems at first sight to require "backward induction from infinity". We establish a simple upper bound on the expected payoff in a given position, allowing efficient and rigorous computer analysis of positions early in the game. In particular we confirm that with 5 heads and 3 tails, stopping is optimal.

Affiliated with

Also associated with

No associations

Rating

Rigorous computer analysis of the Chow-Robbins game does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rigorous computer analysis of the Chow-Robbins game, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rigorous computer analysis of the Chow-Robbins game will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183789