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

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

We study a sealed-bid auction between two bidders with asymmetric independent private values. The two bidders own asymmetric shares in a partnership. The higher bidder buys the lower bidderʼs shares at a per-unit price that is a convex combination of the two bids. The weight of the lower bid is...

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

We consider a market for indivisible items with m buyers and m sellers. Traders privately know their values/costs, which are statistically dependent. Two mechanisms are considered. The buyer's bid double auction collects bids and asks from traders and determines the allocation by selecting a...

We develop a Bayes–Nash analysis of the generalized second-price (GSP) auction, the multi-unit auction used by search engines to sell sponsored advertising positions. Our main result characterizes the efficient Bayes–Nash equilibrium of the GSP and provides a necessary and sufficient...

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