The novelty of our model is to combine models of collective action on networks with models of social learning. Agents are connected according to an undirected graph, the social network, and have the choice between two actions: either to adopt a new behavior or technology or stay with the default...

In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions on the payoff function f and/or extended to the larger set of the Borel probability measures instead of the set of mixed strategies.

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

The power to take game is a simple two player game where players arerandomly divided into pairs consisting of a take authority and responder.Both players in each pair have earned an own income in an individual realeffort decision-making experiment preceding the take game. The gameconsists of two...

Although reciprocity is a key concept in the social sciences, it is still unclear why people engage in costly reciprocation. In this study, physiological and self-report measures were employed to investigate the role of emotions, using the Power-to-Take Game. In this 2-person game, player 1 can...

It is widely recognized that the shape of networks influences both individual and aggregate behavior. This raises the question which types of networks are likely to arise. Our paper fits into the literature that addresses this question. The paper continues on the work of Galeotti, Goyal and...

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

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

In repeated games there is in general a large set of equilibria. We also know that in the repeated prisoners dilemma there is a profusion of neutrally stable strategies, but no strategy that is evolutionarily stable. This paper investigates whether and how neutrally stable strategies can be...