We study two-sided matching contests with two sets, A and B, each of which includes a finite number of heterogeneous agents with commonly known types. The agents in each set compete in a lottery (Tullock) contest, and then are assortatively matched, namely, the winner of set A is matched with...

We study optimal contest design in situations where the designer can reward high performance agents with positive prizes and punish low performance agents with negative prizes. We link the optimal prize structure to the curvature of distribution of abilities in the population. In particular, we...

We study an elimination tournament with heterogenous contestants whose ability is common-knowledge. Each pair-wise match is modeled as an all-pay auction where the winner gets the right to compete at the next round. Equilibrium efforts are in mixed strategies, yielding rather complex play...

We use perturbation analysis to study independent private-value all-pay auctions with weakly risk-averse buyers. We show that under weak risk aversion: 1) Buyers with low values bid lower and buyers with high values bid higher than they would bid in the risk neutral case. 2) Buyers with low...

We use perturbation analysis to study independent private-value all-pay auctions with weakly risk-averse buyers. We show that under weak risk aversion: 1) Buyers with low values bid lower and buyers with high values bid higher than they would bid in the risk neutral case. 2) Buyers with low...

We study the optimal design of organizations under the assumption that agents in a contest care about their relative position. A judicious definition of status categories can be used by a principal in order to influence the agents' performance. We first consider a pure status case where there...

We use perturbation analysis to study independent private-value all-pay auctions with weakly risk-averse buyers. We show that under weak risk aversion: 1) Buyers with low values bid lower and buyers with high values bid higher than they would bid in the risk neutral case. 2) Buyers with low...

We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized fictitious play learning scheme, then for sufficiently large...

We study the optimal design of status classifications in organizational structures under the assumption that agents in a lottery (Tullock) contest care about their relative position. We assume that there are two status categories and a designer who determines their sizes in order to maximize the...