The received characterizations of feasible interim allocations are mostly in the spirit of Border (1991): Fix a family of sets, each containing some player-types, and test the interim allocation under consideration against all these sets. In the published literature, such Border-like...

In this note, we analyze a simple auction mechanism for locating noxious facilities such as hazardous waste dumps, prisons, and trash disposal plants. Specifically, we first delineate the details of our auction mechanism. Next, we solve for the symmetric equilibrium of this auction. Finally, we...

In this note, we analyze a simple auction mechanism for locating noxious facilities such as hazardous waste dumps, prisons, and trash disposal plants. Specifically, we first delineate the details of our auction mechanism. Next, we solve for the symmetric equilibrium of this auction. Finally, we...

We propose a dynamic auction mechanism for efficiently allocating multiple heterogeneous indivisible goods. These goods can be split into two distinct sets so that items in each set are substitutes but complementary to items in the other set. The seller has a reserve value for each bundle of...

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

We study the design of CDS auctions, which determine the payments by CDS sellers to CDS buyers following the defaults of bonds. Through a simple model, we find that the current design of CDS auctions leads to biased prices and inefficient allocations. This is because various restrictions imposed...

We study the existence of efficient auctions in private value settings in which some bidders form their expectations about the distribution of their competitor's bids based on the accessible data from past similar auctions consisting of bids and ex post values. We consider steady states in such...

We consider the problem of allocating objects to a group of agents and how much agents should pay. Each agent receives at most one object and has non-quasi-linear preferences. Non-quasi-linear preferences describe environments where payments influence agents' abilities to utilize objects or...

We consider the problem of allocating heterogeneous objects to agents with money, where the number of agents exceeds that of objects. Each agent can receive at most one object, and some objects may remain unallocated. A bundle is a pair consisting of an object and a payment. An agent's...

We develop a model where two players with asymmetric preferences engage in a contest game. The key novelty is the introduction of multi-dimensional rewards. We characterize the optimal prize allocation that maximizes aggregate effort. When heterogeneity in preferences is strong and the designer...