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

Tuning one's shower in some hotels may turn into a challenging coordination game with imperfect information. The temperature sensitivity increases with the number of agents, making the problem possibly unlearnable. Because there is in practice a finite number of possible tap positions, identical...

Second price allpay auctions (wars of attritions) have an evolutionarily stable equilibrium in pure strategies if valuations are private information. I show that for any level of uncertainty there exists a pure deviation strategy close to the equilibrium strategy such that for some valuations...

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

Recently there has been much theoretical and experimental work on learning in games. However, learning usually means learning about the strategic behavior of opponents rather than learning about the game as such. In contrast, here we report on an experiment designed to test whether players learn...

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

We analyze the strategic behavior of firms when demand is determined by a rule of thumb behavior of consumers. We assume consumer dynamics where individual consumers follow simple behavioral decision rules governed by imitation and habit as suggested in consumer research. On this basis, we...