This puzzle concerns a two-player game, which we set up as follows.

Two players choose a probability distribution over [0, ∞)[0, \, \infty) with mean μ=1\mu = 1. 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 [0, 2][0, \, 2].

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 f(x)f(x). Then the probability that they win is

p(x)≔P[win∣x]={12xif x⩽21otherwise p(x) \coloneqq \mathbb{P}[\text{win} \mid x] = \begin{cases} \tfrac{1}{2} x & \text{if } x \leqslant 2 \\ 1 & \text{otherwise} \end{cases}

which is at most 12x\tfrac{1}{2} x in either case. We can then find the overall probability of winning as:

P[win]=∫0∞p(x)⋅f(x) dx⩽∫0∞12x⋅f(x) dx=12 \mathbb{P}[\text{win}] = \int_0^\infty p(x) \cdot f(x) \ dx \leqslant \int_0^\infty \frac{1}{2} x \cdot f(x) \ dx = \frac{1}{2}

since the latter integral is half the mean of the second player’s distribution, which is 11.

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 N0\mathbb{N}_0. What is the equilibrium?

Suppose the optimal strategy assigned a probability p0p_0 to 00, p1p_1 to 11, p2p_2 to 22, and p+p_+ to numbers greater than 22 in aggregate. Then p1+2p2+3p+⩽μ=1p_1 + 2p_2 + 3p_+ \leqslant \mu = 1.

If p+>0p_+ > 0, then 2(p2+p+)⩽1−p1−p+<12(p_2 + p_+) \leqslant 1 - p_1 - p_+ < 1, so p2+p+<12p_2 + p_+ < \frac{1}{2}, and then p0+p1>12p_0 + p_1 > \frac{1}{2}. But this means the admissible distribution which chooses 00 or 22 with equal probability wins more than half the time, so the other distribution is not optimal! Therefore p+=0p_+ = 0.

Any optimal distribution therefore assigns probability p0p_0 to 00, p1p_1 to 11, p2p_2 to 22, and zero probability to any other outcome. Since μ=p1+2p2=1\mu = p_1 + 2p_2 = 1 and p0+p1+p2=1p_0 + p_1 + p_2 = 1, these distributions are characterised by:

fa(n)={an=01−2an=1an=2 f_a(n) = \begin{cases} a & n = 0 \\ 1-2a & n = 1 \\ a & n = 2 \end{cases}

for some 0⩽a⩽120 \leqslant a \leqslant \tfrac{1}{2}, with zero probability assigned to other outcomes.