A buyer procures a network to span a given set of nodes; each seller bids to supply certain edges, then the buyer purchases a minimal cost spanning tree. An efficient tree is constructed in any equilibrium of the Bertrand game.

We study, theoretically and experimentally, sealed-bid first-price auctions with and without package bidding. In the model, a global bidder bids for multiple items and can benefit from synergies, while local bidders bid for a single item. In the equilibrium, package bidding improves (hurts)...

We propose a new procurement procedure that allocates shares of the total amount to be procured depending on the bids of suppliers. Among the properties of the mechanism are the following: (i) Bidders have an incentive to participate in the procurement procedure, as equilibrium payoffs are...

We characterize the surplus-maximizing trading mechanism under two-sided incomplete information and interim individual rationality, when one party can make a value-enhancing specific investment. This mechanism exhibits a trade-off between providing investment incentives and inducing voluntary...

The standard method for computing the equilibrium strategies of asymmetric first-price auctions is the backward-shooting method. In this study we show that the backward-shooting method is inherently unstable, and that this instability cannot be eliminated by changing the numerical methodology of...

Every agent reports his willingness to pay for one unit of a good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an...

We consider second-price common-value auctions with an increasing number of bidders. We define a strategy of bidder i to be (ex-post, weakly) asymptotically dominated if there is another strategy for i that does, in the limit, as well against any sequence of strategies of iʼs opponents, and...

Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multi-item auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey–English–Dutch auction and it contains the...

I examine a contest with identity-dependent rules in which contestants are privately informed and ex ante heterogeneous. A contestant may suffer from a handicap or benefit from a head start. The former reduces the contestantʼs score by a fixed percentage; the latter is an additive bonus....

In an experiment using two-bidder first-price sealed-bid auctions with symmetric independent private values and 400 participants, we collected information on the female participantsʼ menstrual cycles and the use of hormonal contraceptives. We find that naturally cycling women bid significantly...