OK, I guess I’ll try one more time. First, I claim that, over repeated playings of either game, there will be no limit to the max payoff on a given game. There will be a game that pays off 3^n (or 2*3^n, for Game 2) regardless if n is 100, 1000, googolplex, whatever. The probability of this happening is 100%. It can be proven, but I don’t want to make this overly long, but, basically, remember: We are playing an endless streak of games here, we ain’t gonna stop playing. Ever.
We would expect that, out of 2^n flips, there will be exactly one payoff of 3^n dollars in Game 1. (2*3^n in Game 2, of course). It’s likely that this will happen in one game before another–I don’t think this even requires proof. I’m claiming that, whichever game gets that payoff first, it’s going to screw up the ratio so that it will never be able to settle down to 1/2. That’s going to happen for n=1,2,3,4,…; in other words, it’s always going happen, it will never stop screwing up the ratio.
Here’s why it will screw up the ratio:
Consider the first 2^n flips. As I said, we would expect exactly one of those to have a 3^n dollar winner. The later that win happens, the less likely it is to screw up the ratio. (If it happens early, the ratio will really be lopsided in favor of one or the other. Later on, the total winnings of each game will be large, making a change in one of the total winnings not as significant to the ratio).
Now that that’s established, let’s assume that the 3^n win happens later–say exactly on the (2^n) + 1 flip for one of the games (but not both, since, as I’ve said, it’s unlikely the two games would match up that well). If it screws the ratio up here, it certainly would have screwed it up earlier.
Through the 2^n flips (with no 3^n winner or greater winner yet), what is the total expected winning for each game? Half the games are expected to win on the first flip, a quarter on the second, and so on. The expected winnings are:
(SUM i=1 to n-1) [2^(n-i)]*(3^i)
= 2*(3^n) - (2^n)*3
Of course, the corresponding expected winnings for game 2 will be exactly twice that.
OK, now for the big question: Somewhere along those 2^n flips, we will expect a 3^n (or greater) winner. How much will that knock this ratio off of 1/2?
**If game 1 wins the big one first, the ratio will be:
(1/4) * [3^n - 2^n]/[3^(n-1) - 2^(n-1)]
which has limit 3/4 as n goes to infinity. (NOT 1/2).
If game 2 wins it first, the ratio will be:
[23^(n-1) - 2^n]/[63^(n-1) - 2^(n+1)]
which has limit limit 1/3 as n goes to infinity. (NOT 1/2)**
So if Game 1 is the first to win 3^n (win the game on the nth flip), it screws up the ratio. If Game 2 is the first to win 2 * 3^n (win the game on the nth flip), it screws up the ratio. This will happen over and over again, for each value of n. It won’t converge. Each time a new big win comes (and it will come, 'cause we never stop playing the game), it screws up the ratio–screws up the convergence.
I don’t think I’m capable of making it any clearer than that.
…ebius sig. This is a moebius sig. This is a mo…
(sig line courtesy of WallyM7)