3 ms·
>But you’ve got an improvement because not only does the other number have to match the sign for you to lose, it also has to be larger in magnitude, and that ha
by BeetleB 7y ago
>But you’ve got an improvement because not only does the other number have to match the sign for you to lose, it also has to be larger in magnitude, and that happens in half the cases where they have the same sign, so that gives you 1/4 extra.
This assumes that Player 1 allows for negative numbers. What if Player 1 always writes down positive numbers?
Let's take it a step further. What if Player 1 only writes A and B whenever he plays the game (but we keep changing Player 2 so they never realize this)?
The claim in the paper is that even then they'll guess correct over 50% of the time.
I'm probably wrong about the statement below, but will state it anyway:
I suspect (but cannot quickly prove in my mind) that the other flaw in your argument is utilizing rules like "If the distribution is uniform, you have a 50% chance of picking a positive number, and 50% chance of picking a negative number". The reason I have trouble disproving it is that classical probability theory doesn't allow for such statements: The probability of picking a single point in a continuous distribution is 0.
Edit: I figured out why it works. See this comment and its parent:
https://news.ycombinator.com/item?id=21160811 https://news.ycombinator.com/item?id=21160811