##### On the Sn-Problem
The Chow-Robbins game is a classical still partly unsolved stopping problem introduced by Chow and Robbins in 1965. You repeatedly toss a fair coin. After each toss, you decide if you take the fraction of heads up to now as a payoff, otherwise you continue. As a more general stopping problem this reads $V(n,x) = \sup_{\tau }\operatorname{E} \left [ \frac{x + S_\tau}{n+\tau}\right]$ where $S$ is a random walk. We give a tight upper bound for $V$ when $S$ has subgassian increments. We do this by usinf the analogous time continuous problem with a standard Brownian motion as the driving process. From this we derive an easy proof for the existence of optimal stopping times in the discrete case. For the Chow-Robbins game we as well give a tight lower bound and use these to calculate, on the integers, the complete continuation and the stopping set of the problem for $n\leq 10^{5}$.
###### NurtureToken New!

Token crowdsale for this paper ends in

###### Authors

Are you an author of this paper? Check the Twitter handle we have for you is correct.

###### Subcategory

#1. Which part of the paper did you read?

#2. The paper contains new data or analyses that is openly accessible?
#3. The conclusion is supported by the data and analyses?
#4. The conclusion is of scientific interest?
#5. The result is likely to lead to future research?

User:
Repo:
Stargazers:
0
Forks:
0
Open Issues:
0
Network:
0
Subscribers:
0
Language:
None
Views:
0
Likes:
0
Dislikes:
0
Favorites:
0
0
###### Other
Sample Sizes (N=):
Inserted:
Words Total:
Words Unique:
Source:
Abstract:
None
09/12/19 06:02PM
5,255
1,150
###### Tweets
mathPRb: Sören Christensen, Simon Fischer : On the Sn-Problem https://t.co/BBJpAQwIfY https://t.co/3kXE9YKDlz