We study a sequential (Stackelberg) all-pay auction with two contestants who are privately informed about a parameter (ability) that affects their cost of effort. Contestant 1 (the fi?rst mover) exerts an effort in the fi?rst period, while contestant 2 (the second mover) observes the effort of...

The Aumann (1990) conjecture states that cheap-talk messages do not necessarily help to coordinate on efficient Nash equilibria. In an experimental test of Aumann’s conjecture, Charness (2000) found that cheap-talk messages facilitate coordination when they precede the action, but not when...

Pre-play face-to-face communication is known to facilitate cooperation. Various explanations exist for this effect, varying in their dependence on the strategic content of the communication. Previous studies have found similar communication effects regardless of whether strategic communication...

We introduce a two-player, binary-choice game in which both players have a privately known incentive to enter, yet the combined surplus is highest if only one enters. Repetition of this game admits two distinct ways to cooperate: turn taking and cutoffs, which rely on the player’s private...

Transparency in teams can facilitate cooperation. We study contribution decisions by agents when previous decisions can be observed. We find that an information chain, in which each agent directly observes only the decision of her immediate predecessor, is at least as effective as a...

We develop a model of school choice in which the demand for religious schooling is driven partly by the desire of parents to limit their children’s exposure to the influences of competing religions. This framework links the literature on the effects of religious market shares on the...

We identify an ordinal decomposability property and use it, along with other ordinal axioms, to characterize the Theil inequality ordering.

Job applicants in Europe and in Israel increasingly imbed a headshot of them- selves in the top corner of their CVs. We sent 5312 CVs in pairs to 2656 advertised job open- ings. In each pair, one CV was without a picture while the second, otherwise almost identical CV contained a picture of...

We study a sequential two-stage all-pay auction with two identical prizes. In each stage, the players compete for one prize and each player may win either one or two prizes. The designer may impose a cap on the players' bids in each of the stages. We analyze the equilibrium in this sequential...

We study a round-robin tournament with n symmetric players where in each of the n-1 stages each of the players competes against a different player in the Tullock contest. Each player has a limited budget of effort that decreases within the stages proportionally to the effort he exerted in the...