Let players have independent values uniform on , unit effort costs, and equal prizes of size . In the symmetric Bayesian Nash equilibrium, total expected effort is
The support 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 is nonzero, so total effort is . The corresponding descending order statistic of uniform values has mean . Equivalently, the all-pay effort identity gives , where the allocation derivative is a Beta distribution density with parameters .
For prize scale , total effort is proportional to on the feasible grid . If , one prize is optimal. For , increases up to and then decreases, so the optimal feasible integer is among and . Remove infeasible candidates and compare their objective values. No definition at is needed.

Articles by others on the same topic (0)

There are currently no matching articles.