It is shown that the n-player lottery contest admits a best-response potential (Voorneveld, 2000, Economics Letters). This is true also when the contest technology reflects the possibility of a draw. The result implies, in particular, the existence of a non-trivial two-player zero-sum game that...

This paper studies the dynamic construction of a blockchain by competitive miners. In contrast to the literature, we assume a finite time horizon. Moreover, miners are rewarded for blocks that eventually become part of the longest chain. It is shown that popular mining strategies such as...

The paper studies a dynamic communication game in the presence of adverse selection and career concerns. A forecaster of privately known competence, who cares about his reputation, chooses the timing of the forecast regarding the outcome of some future event. We find that in all equilibria in a...

We experimentally implement a dynamic public-good problem, where the public good in question is the dynamically evolving information about agents' common state of the world. Subjects' behavior is consistent with free-riding because of strategic concerns. We also find that subjects adopt more...

This paper studies fictitious play in networks of noncooperative two-person games. We show that continuous-time fictitious play converges to the set of Nash equilibria if the overall n-person game is zero-sum. Moreover, the rate of convergence is 1/T, regardless of the size of the network. In...

We experimentally study settings where an individual may have an incentive to adopt negative beliefs about another's intentions in order to justify egoistic behavior. Our first study uses a game in which a player can take money from an opponent in order to prevent the opponent from subsequently...

We design experimental games to evaluate the predictive power of the first cheap‐talk refinement, neologism‐proofness. In our first set of treatments designed to evaluate the refinement with its usual emphasis on literal meanings, we find that a fully revealing equilibrium that is...

We implement multi-sender cheap talk in the laboratory. While full-information transmission is not theoretically feasible in the standard one-sender-one- dimension model, in this setting with more senders and dimensions, full revelation is generically a robust equilibrium outcome. Our...

We study communication in a two-player coordination game with Pareto-ranked equilibria. Prior research demonstrates that efficient coordination is difficult without communication but obtains regularly with (mandatory) costless pre-play messages. In a laboratory experiment, we modify...

Imposing equilibrium restrictions provides substantial gains in the estimation of dynamic discrete games. Estimation algorithms imposing these restrictions have different merits and limitations. Algorithms that guarantee local convergence typically require the approximation of high-dimensional...