In competitive procurement auctions, bids often have the form of unit-price contracts (UPCs). We show that optimal bidding behavior in UPC auctions is typically nonmonotonic and therefore may lead to inefficient allocations. However, UPC auctions may still be desirable for the buyer when...

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

It is a common experience for present-day consumers making an international payment via credit or debit card to be invited to choose the currency in which they wish to have the transaction executed. While this choice, made feasible by a technology known as dynamic currency conversion (DCC),...

This paper considers all-pay contests in which the relationship between bids and allocations 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 studies the incentives for interim voluntary disclosure of verifiable information in probabilistic all-pay contests. Provided that the contest is uniformly asymmetric, full revelation is the unique perfect Bayesian equilibrium outcome. This is so because the weakest type of the...

For users of the Ethereum network, the gas price is a crucial parameter that determines how swiftly the decentralized consensus protocol confirms a transaction. This paper studies the statistics of the Ethereum gas price. We start with some conceptual discussion of the gas price notion in view...

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

The symmetric two-player Hirshleifer (1989) contest is shown to admit a unique equilibrium. The support of the equilibrium strategy is finite and includes, in particular, the zero expenditure level. We also establish a lower bound for the cardinality of the support and an upper bound for the...

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