The Allocation of a Prize (R)

Consider agents who undertake costly effort to produce stochastic outputs observable by a principal. The principal can award a prize deterministically to the agent with the highest output, or to all of them with probabilities that are proportional to their outputs. We show that, if there is sufficient diversity in agents’ skills relative to the noise on output, then the proportional prize will, in a precise sense, elicit more output on average, than the deterministic prize. Indeed, assuming agents know each others’ skills (the complete information case), this result holds when any Nash equilibrium selection, under the proportional prize, is compared with any individually rational selection under the deterministic prize. When there is incomplete information, the result is still true but now we must restrict to Nash selections for both prizes.

We also compute the optimal scheme, from among a natural class of probabilistic schemes, for awarding the prize; namely that which elicits maximal effort from the agents for the least prize. In general the optimal scheme is a monotonic step function which lies “between” the proportional and deterministic schemes. When the competition is over small fractional increments, as happens in the presence of strong contestants whose base levels of production are high, the optimal scheme awards the prize according to the “log of the odds,” with odds based upon the proportional prize.

Keywords: Deterministic/proportional/optimal prizes, Games of complete/incomplete information, Nash equilibrium, Individually rational strategies

JEL Classification: C70, C72, C79, D44, D63, D82