Quote:
Originally Posted by masque de Z
We can show there is a strategy that has positive expectation if we do not do the play forever no matter what thing from the start but later under some conditions met only.
This is a conceptually simple though computationally complex game.
There are two indistinguishable hats. One hat has a piece of paper that reads "You win $1" and the other hat has a piece of paper that says "You lose $10,000,000." Once you pick a hat, you can draw the slip of paper out as many times as you want and the corresponding action is taken.
Here's your N draw strategy: Pick one hat at random and draw the slip of paper. If you lost money, stop drawing. If you won money, draw N-1 more times. Your EV is -$5,000,000 + 0.5*N. As N goes to infinity, so does your EV.
And it doesn't actually matter that there are two hats. Let's say that there are a billion hats and only one of them has the winner paper in it. You still have that one large win to offset any amount of loss you might sustain. It all comes down to the fact that there is a situation in which you can win infinite money and that you can identify stop-losses when you're in a losing situation. All that the extra probability element does is make it so that you have to do some calculations to figure out whether to play on or stop, because your knowledge of the distributions will require you to flip the coin many times rather than simply knowing right away.
So the only interesting thing is identifying when you're in the winning condition, not that you should be willing to pay infinite money to play this game.