Uniform-value multi-prize all-pay effort formula (source code)

= Uniform-value multi-prize all-pay effort formula
{title2=$R_m=\frac{m(n-m)}{n+1}w(m/n)$}

Let $n\ge2$ players have independent values uniform on $[0,1]$, unit effort costs, and $1\le m<n$ equal prizes of size $w(m/n)>0$. In the symmetric <Bayesian Nash equilibrium>, total expected effort is
$$
R_m=\frac{m(n-m)}{n+1}w(m/n).
$$
The support $[0,1]$ fixes the scale; a different uniform interval requires adjusting the order-statistic calculation.

One proof uses <expected effort in a rank-order contest>: only prize layer $m$ is nonzero, so total effort is $m w(m/n)\mathbb EV_{[m+1]}$. The corresponding descending <order statistic> of $n$ uniform values has mean $(n-m)/(n+1)$. Equivalently, the <all-pay effort identity> gives $b(v)=w(m/n)\int_0^v t q_m'(t)dt$, where the allocation derivative is a <Beta distribution> density with parameters $n-m,m$.