We characterize the equilibrium of the all-pay auction with general convex cost of effort and sequential effort choices. We consider a set of n players who are arbitrarily partitioned into a group of players who choose their efforts ?early? and a group of players who choose ?late?. Only the...

We study how norms can solve distributional conflict inside a clan and the efficient coordination of collective action in a conflict with an external enemy.We characterize a fully non-cooperative equilibrium in a finite game in which a self-enforcing norm coordinates the members on efficient...

We characterize the equilibrium of the all-pay auction with general convex cost of effort and sequential effort choices. We consider a set of n players who are arbitrarily partitioned into a group of players who choose their efforts 'early' and a group of players who choose 'late'. Only the...

In the equilibrium of the all-pay auction with two groups of individual players who move sequentially, only the player with the lowest effort cost has a positive payoff. This payoff and the overall dissipation crucially depend on group composition.

We characterize the equilibrium of the all-pay auction with general convex cost of effort and sequential effort choices. We consider a set of n players who are arbitrarily partitioned into a group of players who choose their efforts ’early’ and a group of players who choose ’late’. Only...

We characterize the equilibrium of the all-pay auction with general convex cost of effort and sequential effort choices. We consider a set of n players who are arbitrarily partitioned into a group of players who choose their efforts 'early' and a group of players who choose 'late'. Only the...

We show how norms can solve the distributional conflict inside a group in an anarchic environment and yield efficient coordination of collective action in a conflict with an external competitor. The equilibrium of the fully non-cooperative game with finite horizon has two interesting features....

We study how norms can solve distributional conflict inside a clan and the efficient coordination of collective action in a conflict with an external enemy. We characterize a fully non-cooperative equilibrium in a finite game in which a self-enforcing norm coordinates the members on efficient...

We characterize the equilibrium of the all-pay auction with general convex cost of effort and sequential effort choices. We consider a set of n players who are arbitrarily partitioned into a group of players who choose their efforts ’early’ and a group of players who choose ’late’. Only...

In the equilibrium of the all-pay auction with two groups of individual players who move sequentially, only the player with the lowest effort cost has a positive payoff. This payoff and the overall dissipation crucially depend on group composition.