We give a sufficient condition on the type space for revenue equivalence when the set of social alternatives consists of probability distributions over a finite set. Types are identified with real-valued functions that assign valuations to elements of this finite set, and the type space is...

We give a sufficient condition on the type space for revenue equivalence when the set of social alternatives consists of probability distributions over a finite set. Types are identified with real-valued functions that assign valuations to elements of this finite set, and the type space is...

We study intermediaries who seek to maximize gains from trade in bilateral negotiations. Intermediaries are players: they cannot commit to act against their objective function and deny, in some cases, trade they believe to be beneficial. This impairs their ability to assist the parties relative...

We provide conditions that simplify applying Reny's (1999) better-reply security to Bayesian games, and use these conditions to prove the existence of equilibria for classes of games in which payoff discontinuities arise only at "ties." These games include a general version of all-pay contests,...

The price mechanism is fundamental to economics but difficult to reconcile with incentive compatibility and individual rationality. We introduce a double clock auction for a homogeneous good market with multidimensional private information and multiunit traders that is deficit-free, ex post...

We study when equilibrium prices can aggregate information in an auction market with a large population of traders. Our main result identifies a property of information---the betweenness property---that is both necessary and sufficient for information aggregation. The characterization provides...

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

I investigate the design of effort-maximizing mechanisms when agents have both private information and convex effort costs, and the designer has a fixed prize budget. I first demonstrate that it is always optimal for the designer to utilize a contest with as many participants as possible....

We analyze a setting common in privatizations, public tenders, and takeovers in which the ex post efficient allocation, i.e., the first best, is not implementable. Our first main result is that the open ascending auction is not second best because it is prone to rushes, i.e., all active bidders...

Many sales, sports, and research contests are put in place to maximize contestants' performance. We investigate and provide a complete characterization of the prize structures that achieve this objective in settings with many contestants. The contestants may be ex-ante asymmetric in their...