Maximum efforts in contests with asymmetric valuations

Efforts may be reduced when players with different valuations participate in a contest. This paper considers the problem of designing a contest to elicit maximum aggregate effort from players with asymmetric valuations. Optimal designs for different classes of contest technologies are computed and characterized. A value weighted contest is optimal in the concave case. In the unconstrained case, the optimal contest is equivalent to a first price all-pay auction with a reserve price. The optimal design discounts the effort of the high valuation player in order to induce him to compete vigorously.