I'd like to offer my own humble solution. Maybe it's flawed. Maybe you can embarass me. :)
Here it is: the goal is to choose a strategy which statistically maximizes our return. I.e. strategy A is superior to strategy B if it yields higher returns after, say, 1,000,000 iterations.
So there are two envelopes, X and 2X. You select one, then you're offered a chance to change your selection. What do you do?
Let's write out all the possibilities:
You select X, then you choose to stay, and wind up with X.
You select 2X, then you choose to stay, and wind up with 2X.
You select X, then you choose to swap, and wind up with 2X.
You select 2X, then you choose to swap, and wind up with X.
Those are the only four possibilities. You're forced to choose one of these possibilities randomly, because you have no information to guide your choice. Since two of them yield 2X and two yield X, and since your choice is necessarily random, then therefore all strategies will converge on the same expected value. In short, it doesn't matter what you do. You always have a 50% chance of X or 2X, regardless of your sequence of choices.
At first glance this is similar to the Monty hall problem, but the critical difference is that information is revealed during the Monty hall problem. No extra info is revealed here.
I assert that the envelopes could contain X and 1000X and it still doesn't matter what you do.
Ok, go, embarass me!