March 1st, 2009, 11:02 pm
QuoteOriginally posted by: cm27874The expected value of the maximum of n iid uniform random variables on [0,100] should be 100 * n / ( n+1). Hence you should choose n such thatn * ( 100 / (n+1) - x )becomes maximal.I am just a beginner in probability but I have a concern about this solution. The expected maximum 100*n/(n+1) is true only if no round has been played yet. Once the first round is played, then that expected maximum is not that value any more, isn't it ?Here is my solution for this problem. Call the expected value of the game F. Consider what happens after the first round. If you stop after the first round, the payoff is X1 - x. If you continue, then the game basically repeats itself, only that you have lost x paying for the first round's fee. Thus the expected payoff for continuing is F - x. The optimal stopping strategy is then to stop if X1 >= F. Consequently, we have the equation F = (100-F)*(100+F)/200 + F*F/100 - x => F = 100 - 10*sqrt(2x).