The Distribution Game
This puzzle concerns a two-player game, which we set up as follows.
Two players choose a probability distribution over with mean . Then, each player independently draws a number from their distribution. The player with the highest number wins (in the event of a tie, the game is replayed). What is the Nash equilibrium?
Spoiler wall! Read past here when you want to know the answer.
Solution
In fact, the equilibrium is for both players to select the uniform distribution on .
It’s easy to show that this strategy cannot be beaten. Suppose the first player chooses this strategy, and the second player chooses the distribution . Then the probability that they win is
which is at most in either case. We can then find the overall probability of winning as:
since the latter integral is half the mean of the second player’s distribution, which is .
So whatever they choose, the second player cannot win more than half the time. Of course, they draw with probability zero, so this strategy is unbeatable.
Now, consider the same game, but with a distribution over the non-negative integers . What is the equilibrium?
Suppose the optimal strategy assigned a probability to , to , to , and to numbers greater than in aggregate. Then .
If , then , so , and then . But this means the admissible distribution which chooses or with equal probability wins more than half the time, so the other distribution is not optimal! Therefore .
Any optimal distribution therefore assigns probability to , to , to , and zero probability to any other outcome. Since and , these distributions are characterised by:
for some , with zero probability assigned to other outcomes.