In models of non-deterministic contest, players exert irreversible effort in order to increase their probability of winning a prize. The most prominent functional form of the win probability in the literature is the so-called logit" contest success function. We provide a simple micro-foundation...

The key element of models of contest is the Contest Success Function (CSF) which specifies the winning probabilities of agents. We provide an axiomatization of two parametric families of CSF's. In the first, the winning probability of each agent depends on the investments and a vector of...

We analyze the performance of various communication protocols in a generalization of the Crawford-Sobel (1982) model of cheap talk that allows for multiple receivers. We find that whenever the sender can communicate informatively with both receivers by sending private messages, she can...

This paper considers incentives for information acquisition ahead of conflicts. First, we characterize the (unique) equilibrium of the all-pay auction between two players with one-sided asymmetric information where one player has private information about his valuation. Then, we use ou rresults...

We consider a general class of imperfectly discriminating contests with privately informed players. We show that findings by Athey (2001) imply the existence of a Bayesian Nash equilibrium in monotone pure strategies.

We consider a variant of the Tullock rent-seeking contest. Under symmetric information we determine equilibrium strategies and prove their uniqueness. Then, we assume contestants to be privately informed about their costs of effort. We prove existence of a pure-strategy equilibrium and provide a...

Can comparative statements be credible even when absolute statements are not? For instance, can a professor credibly rank different students for a prospective employer even if she has an incentive to exaggerate the merits of each student? Or can an analyst credibly rank different stocks even if...

This paper experimentally examines behavior in a two-player game of attack and defense of a weakest-link network of targets, in which the attacker's objective is to successfully attack at least one target and the defender's objective is diametrically opposed. We apply two benchmark contest...

We present a general model of two players contest with two types of efforts. Contrary to the classical models of contest, where each player chooses a unique effort, and where the outcome depends on the efforts of all the players, contestants are allowed to reduce the effort of the opponent....

In models of non-deterministic contest, players exert irreversible effort in order to increase their probability of winning a prize. The most prominent functional form of the win probability in the literature is the so-called "logitʺ contest success function. We provide a simple...