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...

We introduce a simple two-stage game of endogenous network formation and information sharing for reasoning about the optimal design of social networks like Facebook or Google. We distinguish between unilateral and bilateral connections and between targeted and collective information sharing....

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...

In this paper we introduce a stochastic network formation model where agents choose both actions and links. Neighbors in the network benefit from each other's action levels through local complementarities and there exists a global interaction effect reflecting a strategic substitutability 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...

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 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...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. lt turns out that the first-order approach is not innocuous. For example, in...

We consider a class of incomplete-information Colonel Blotto games in which N ≥ 2 agents are engaged in (N + 1) battlefields. An agent's vector of battlefield valuations is drawn from a generalized sphere in L_p-space. We identify a Bayes-Nash equilibrium in which any agent's resource...