Intuitively, we expect that players who are allowed to engage in costless communication before playing a game would be foolish to agree on an inefficient equilibrium. At the same time, however, such preplay communication has been suggested as a rationale for expecting Nash equilibrium in...

We explore in an equilibrium framework whether games with multiple Nash equilibria are easier to play when players can communicate. We consider two variants, modelling talk about future plans and talk about past actions. The language from which messages are chosen is endogenous, messages are...

Games with multiple Nash equilibria are believed to be easier to play if players can communicate. We present a simple model of communication in games and investigate the importance of when communication takes place. Sending a message before play captures talk about intentions, after play...

This paper characterizes geometrically the set of all Nash equilibrium payoffs achievable with unmediated communication in persuasion games, i.e., games with an informed expert and an uninformed decisionmaker in which the expert's information is certifiable. The first equilibrium...

This paper studies theoretically and experimentally how the possibility of a negative payoff to one player in 2-by-2 hawk-dove games affects the strategic behavior of both players. Exposing column players to a possibility of negative payoff allows us to examine if row players can anticipate the...

This paper studies the incentives for interim voluntary disclosure of verifiable information in probabilistic all-pay contests with two-sided incomplete information. Private information may concern marginal cost, valuations, and ability. Our main result says that, if the contest is uniformly...

In this paper, we study N-player Colonel Blotto games with incomplete information about battlefield valuations. Such games arise in job markets, research and development, electoral competition, security analysis, and conflict resolution. For M ≥ N + 1 battlefields, we identify a Bayes-Nash...

This paper introduces a class of contest models in which each player decides when to stop a privately observed Brownian motion with drift and incurs costs depending on his stopping time. The player who stops his process at the highest value wins a prize. We prove existence and uniqueness of a...

We study adaptation to climate change in a federalist setting. To protect themselves against an increase in flood risk, regional governments choose among adaptation measures that vary with respect to their costs, the level of protection they offer, and the presence and nature of spillovers to...

This article examines behavior in two-person constant-sum Colonel Blotto games in which each player maximizes the expected total value of the battlefields won. A lottery contest success function is employed in each battlefield. Recent experimental research on such games provides only partial...