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

This paper studies strategic interaction in networks. We focus on games of strategic substitutes and strategic complements, and departing from previous literature, we do not assume particular functional forms on players' payoffs. By exploiting variational methods, we show that the uniqueness,...

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

We consider one-to-one matching problems under two modalities of uncertainty that differ in the way types are assigned to agents. Individuals have preferences over the possible types of the agents from the opposite market side and initially know the "name" but not the "type" of the other...

The best shot game applied to networks is a discrete model of many processes of contribution to local public goods. It has generally a wide multiplicity of equilibria that we refine through stochastic stability. In this paper we show that, depending on how we define perturbations, i.e. the...

Risk of stock collapse is a genuine motivation for cooperative fisheries management. We analyse the effect of an endogenously determined risk of stock collapse on the incentives to cooperate in a Great Fish War model. We establish that equilibrium harvest strategies are non-linear in stock and...

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

Brenner and Vriend (2006) argued (experimentally and theoretically) that one should not expect proposers in ultimatum games to learn to converge to the subgame perfect Nash equilibrium offer, as finding the optimal offer is a hard learning problem for (boundedly-rational) proposers. In this...

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