Customers of network commodities face coordination problems due to adoption externalities that give rise to multiple, Pareto-ranked equilibria. We investigate the extent to which the coordination problem can be resolved by inducement schemes when agents' preferences are private information....

This paper explores a multiple-object auction with the following three features: First, there is a capacity constraint, as each bidder can win at most one object from the auction. Second, the objects for sale and the bidders are located around the unit circle. A bidder's valuation of a certain...

Suppose a seller wants to sell k similar or identical objects and there are n k potential buyers. Suppose that each buyer wants only one object. In this case, we suggest the use of a simultaneous auction that would work as follows. Players are asked to submit sealed bids for one object. The...

A common assumption in the analysis of symmetric auctions is that the bidders' value estimates exhibit positive informational externalities (PIE). This assumption implies upward drifting price sequences at sequential auctions, which is challenged by an empirical regularity, known as the...

We study optimal auctions in a symmetric private values setting, where bidders' care about winning the object and a receiver's inference about their type. We reestablish revenue equivalence when bidders' signaling concerns are linear, and the auction makes participation observable via an entry...

This paper studies a model of mechanism design with transfers where agents' preferences need not be quasilinear. In such a model, (1) we characterize dominant strategy incentive compatible mechanisms using a monotonicity property; (2) we establish a revenue uniqueness result: for every dominant...

We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders’ independent signals. If the object is optimally sold with probability one, then the optimal mechanism is simply a posted price, with the highest...

Two experimental treatments are used to study the effects of auction risk across five mechanisms. The first canonical, baseline treatment features only strategic risk and replicates the standard results that overbidding relative to the risk neutral Nash equilibrium is prevalent in all common...

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

An important result in convex analysis is the duality between a closed convex set and its support function. We exploit this duality to develop a novel geometric approach to mechanism design. For a general class of social choice problems we characterize the feasible set, which is closed and...