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

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

Szidarovszky and Okuguchi (Games and Economic Behavior, 1997) have provided useful conditions for the existence of a unique pure-strategy Nash equilibrium in rent-seeking games of complete information. In this paper, we generalize their results to contests with incomplete informa tion. Two...

This paper considers all-pay contests in which the relationship between bids and allocation reflects a small amount of noise. Prior work had focused on one particular equilibrium. However, there may be other equilibria. To address this issue, we introduce a new and intuitive measure for the...

This paper constructs a novel equilibrium in the chopstick auction of Szentes and Rosenthal (Games and Economic Behavior, 2003a, 2003b). In contrast to the existing solution, the identified equilibrium strategy allows a simple and intuitive characterization. Moreover, its best-response set has...

This paper studies fictitious play in networks of noncooperative two-player games. We show that continuous-time fictitious play converges to Nash equilibrium provided that the overall game is zero-sum. Moreover, the rate of convergence is 1/T , regardless of the size of the network. In contrast,...

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 nontrivial example of a strictly...

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.