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...

This paper examines multi-battle contests whose extensive form can be represented in terms of a finite state machine. We start by showing that any contest that satisfies our assumptions decomposes into two phases, a principal phase (in which states cannot be revisited) and a concluding...

We allow a contest organizer to bias a contest in a discriminatory way, that is, she can favor specific contestants through the choice of contest success functions in order to maximize total equilibrium effort (resp. revenue). The scope for revenue enhancement through biasing is analyzed and...

This paper studies a large class of imperfectly discriminating contests, referred to as elastic contests, that induce players to either overbid a standing bid or to abstain from bidding altogether. Many common forms of contest are elastic. In any equilibrium of an elastic contest, there is...

We characterize the equilibrium set of the n-player Hirshleifer contest with homogeneous valuations. A symmetric equilibrium always exists. It necessarily corresponds to multilateral peace for sufficient noise and uses finite-support randomized strategies otherwise. Asymmetric equilibria are...

While the game-theoretic analysis of conflict is often based upon the assumption of multiplicative noise, additive noise such as assumed by Hirshleifer (1989) may be equally plausible depending on the application. In this paper, we examine the equilibrium set of the n-player difference-form...

While the game-theoretic analysis of conflict is often based on the assumption of multiplicative noise, additive noise such as considered by Hirshleifer (1989) may be equally plausible depending on the application. In this paper, we examine the equilibrium set of the n-player difference-form...

I characterize the optimal accuracy level r of an unbiased Tullock contest between two players with heterogeneous prize valuations. The designer maximizes the winning probability of the strong player or the winner’s expected valuation by choosing a contest with an all-pay auction equilibrium...

I characterize the optimal accuracy level r of an unbiased Tullock contest between two players with heterogeneous prize valuations. The designer maximizes the winning probability of the strong player or the winner’s expected valuation by choosing a contest with an all-pay auction equilibrium...

In this paper, we study N-player Colonel Blotto games with incomplete information about battlefield valuations. Such games arise in job markets, research and development, electoral competition, security analysis, and conflict resolution. For M ≥ N + 1 battlefields, we identify a Bayes-Nash...