This paper studies the dynamic construction of a blockchain by competitive miners. In contrast to the literature, we assume a finite time horizon. It is shown that popular mining strategies such as adherence to conservative mining or to the longest-chain rule constitute pure-strategy Nash...

This paper studies the dynamic construction of a blockchain by competitive miners. In contrast to the literature, we assume a finite time horizon. It is shown that popular mining strategies such as adherence to conservative mining or to the longest-chain rule constitute pure-strategy Nash...

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 examines multi-battle contests whose extensive form can be represented in terms of a finite state machine. We start by showing that any contest that satisfies our assumptions decomposes into two phases, a principal phase (in which states cannot be revisited) and a concluding...

This paper examines multi-battle contests whose extensive form can be represented in terms of a finite state machine. We start by showing that any contest that satisfies our assumptions decomposes into two phases, a principal phase (in which states cannot be revisited) and a concluding...

This paper considers rent-seeking games in which a small percentage change in a player's bid has a large percentage impact on her odds of winning, i.e., on the ratio of her respective probabilities of winning and losing. An example is the Tullock contest with a high R. The analysis provides a...

It is shown that the equilibrium in the asymmetric Tullock contest is unique for parameter values r È 2. This allows proving a revenue ranking result saying that a revenue-maximizing designer capable of biasing the contest always prefers a contest technology with higher accuracy.

We characterize the equilibrium set of the n-player Hirshleifer contest with homogeneous valuations. A symmetric equilibrium always exists. It necessarily corresponds to multilateral peace for sufficient noise and uses finite-support randomized strategies otherwise. Asymmetric equilibria are...

At the time of writing, the Riemann Hypothesis (RH) is one of the major unsolved problems in pure mathematics. In this note, a parameterized family of non-cooperative games is constructed with the property that, if RH holds true, then any game in this family admits a unique Nash equilibrium.

This paper studies Colonel Blotto games with two battlefields where one player has a head start in the form of additional troops on one of the battlefields. Such games arise naturally in marketing, electoral competition, and military conflict. Sion and Wolfe (1957) have shown that, if the...