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

The literature on ascending combinatorial auctions yields conflicting insights regarding the possibility to implement the Vickrey payoffs for general valuations. We introduce the class of minimal ascending auctions, a class which allows one to disconnect the final payments from the final bids...

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 how resale affects auctions with costly entry in a model where bidders possess two-dimensional private information signals: entry costs and valuations. We establish the existence of symmetric entry equilibrium and identify sufficient conditions under which the equilibrium is unique. Our...

Bidders often face avoidable fixed costs or other synergies that can make bidding decisions complex and risky, and market outcomes volatile. If bidders deviate from risk neutral best responses, either due to faulty optimization or a preference to avoid volatility, then equilibrium predictions...

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 study the efficient allocation of a single object over a finite time horizon. Buyers arrive randomly over time, are long-lived, and have independent private values. The valuation of a buyer may depend on the time of the allocation in an arbitrary way. We construct an incentive compatible...

When bidders in a corporate takeover have related resources and post-acquisition strategies, their valuations of a target are likely to be interdependent. This paper analyzes sequential-entry takeover contests in which similar bidders have correlated private valuations. The level of similarity...

A number of identical objects is allocated to a set of privately informed agents. Agents have linear utility in money. The designer wants to assign objects to agents that possess specific traits, but the allocation can only be conditioned on the willingness to pay and on observable...

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