News for hackers. Stuff that matters.
Re:The envelope paradox (2006) by JackFr on Monday November 30, 2015 @09:55AM (#10649664)
I don't think I make any assumptions about A,B other than that they're on the real line. Regardless, as the puzzle stands, there is no way to show that P[A < R < B] > 0. Since you can't show that, you can't claim that the strategy ever yields performance > 50%.
Re:The envelope paradox (2006) by fenomas on Monday November 30, 2015 @10:47AM (#10649951)
> there is no way to show that P[A < R < B] > 0

As the puzzle and strategy are stated, the methods for choosing A/B/R are all left unspecified. If we don't know how they're chosen, it stands to reason that we can't rule out the possibility of R falling between A and B, hence there's a nonzero chance of it happening. If you want a rigorous way to show this even for any given opponent strategy, the player can choose R from an unbounded distribution - which is nonzero everywhere, and therefore nonzero between A and B, for any choices of A!=B.

Re:The envelope paradox (2006) by umanwizard on Monday November 30, 2015 @12:32PM (#10650582)
"Can't rule out the possibility" isn't the same thing as "nonzero probability".

E.g. pick a number uniformly at random between 0 and 1. It might be rational, but the probability of that is 0.

Re:The envelope paradox (2006) by fenomas on Thursday December 03, 2015 @12:49AM (#10667991)
You're moving the goalposts from what the article claims.

The opponent's strategy is unknown and unspecified, per the puzzle. The point of the article is that there is a strategy that never does worse than chance, and may do better, depending on the opponent's choice of numbers. Sure, the opponent can make your advantage arbitrarily small - the article says that directly. But the notion that they are trying to do so is not part of the puzzle, and finding a strategy that prevents them from doing so is not what the author claims to have done.