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

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...

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

We characterize the class of symmetric two-player games in which tit-for-tat cannot be beaten even by very sophisticated opponents in a repeated game. It turns out to be the class of exact potential games. More generally, there is a class of simple imitation rules that includes tit-for-tat but...

We provide an evolutionary foundation to evidence that in some situations humans maintain either optimistic or pessimistic attitudes towards uncertainty and are ignorant to relevant aspects of the environment. Players in strategic games face Knightian uncertainty about opponents' actions and...

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...

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 define a cautious version of extensive-form rationalizability for generalized extensive- form games with unawareness that we call prudent rationalizability. It is an extensive-form analogue of iterated admissibility. In each round of the procedure, for each tree and each information set of a...