This paper provides a solution to a puzzle in the analysis of tournaments, that of why there is no agent discrimination or differential contracting in certain business practice settings. The paper examines the problem of a principal contracting with multiple agents whose activities are subject...

This paper examines "market-based tournaments", in which firms use the tournament outcome to update their expectations about worker ability. A theoretical model offers several implications, which are unique to the market-based tournament and which we test in a laboratory experiment. The...

This study investigates the effects of transparency in a sequential moral hazard problem, where a leader and a follower consecutively take an action. The principal chooses whether the organization is transparent or opaque, by which we mean that the action of the leader is observable to the...

The literature on aggregative games, which has been applied in the study of contests, has focused on simultaneous games. We apply aggregative games techniques in a novel fashion in the analysis of sequential lottery contests with n players. It is shown that: (1) there exists a unique subgame...

Two agents participate in a tournament that has two stages: intermediate and final. The results of the intermediate stage are privately observed by the principal who organizes the tournament. Prizes for the winner and the loser are exogenously given, but the principal can enhance effort...

In the second paper I analyze a three-player variant of Hotelling's (1929) influential locational choice model experimentally and theoretically, where entry is sequential instead of simultaneous. I find that first, Duverger’s Law (1959) is robust to violations of the gametheoretical prediction...

We analyze a repeated game in which countries are polluting and investing in technologies. While folk theorems point out that the first best can be sustained as a subgame-perfect equilibrium when the players are sufficiently patient, we derive the second-best equilibrium when they are not. This...