Suppose that individual payoffs depend on the network connecting them. Consider the following simultaneous move game of network formation: players announce independently the links they wish to form, and links are formed only under mutual consent. We provide necessary and sufficient conditions on...

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

Delayed perfect monitoring in an infinitely repeated discounted game is modelled by allocating the players to a connected and undirected network. Players observe their immediate neighbors' behavior only, but communicate over time the repeated game's history truthfully throughout the network. The...

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

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

This paper first establishes a new core theorem using the concept of generated payoffs: the TU (transferable utility) core is empty if and only if the maximum of generated payoffs (mgp) is greater than the grand coalition's payoff v(N), or if and only if it is irrational to split v(N). It then...

We generalise the coalition structure core to partition function games. Our definition relies only on one crucial assumption, namely that there is some internal consistency in the game: residuals of the deviation play a game similar to the initial one, and –whenever this is possible– they...