We consider a two-player all-pay auction with symmetric independent private values that are uniformly distributed. The designer chooses the size of a head start that is given to one of the players. The designer's objective is to maximize a convex combination of the expected highest effort and...

We introduce a new solution concept for models of coalition formation, called the myopic stable set. The myopic stable set is defined for a very general class of social environments and allows for an infinite state space. We show that the myopic stable set exists and is non-empty. Under minor...

This paper analyzes a two-player all-pay auction with incomplete information. More precisely, one bidder is uncertain about the size of the initial advantage of his rival modeled as a head start in the auction.I derive the unique Bayesian Nash equilibrium outcome for a large class of cumulative...

We consider a two-player contest model in which breakthroughs arrive according to privately observed Poisson processes. Each player's process continues as long as she exerts costly effort. The player who collects most breakthroughs until a predetermined deadline wins a prize.We derive Nash...

During the COVID-19 pandemic, traditional (offline) chess tournaments were prohibited and instead held online. We exploit this unique setting to assess the impact of remote--work policies on the cognitive performance of individuals. Using the artificial intelligence embodied in a powerful chess...