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

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. lt turns out that the first-order approach is not innocuous. For example, in...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. lt turns out that the first-order approach is not innocuous. For example, in...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. It turns out that the first-order approach is not innocuous. For example, in...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. It turns out that the first-order approach is not innocuous. For example, in...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. lt turns out that the first-order approach is not innocuous. For example, in...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. lt turns out that the first-order approach is not innocuous. For example, in...

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