We examine a general equilibrium model with asymmetrically informed agents. The presence of asymmetric information generally presents a conflict between incentive compatibility and Pareto efficiency. We present a notion of informational size and show that the conflict between incentive compatibility and efficiency can be made arbitrarily small if agents are of sufficiently small informational s...

We introduce and study a new auction model in which a certain type of goods is offered over a period of time, and buyers arrive at different times and stay until a common deadline (unless their purchase requests have been fulfilled). We examine in this model incentive compatible auction protocols (i.e., those that induce participants to bid their true valuations). We establish an interesting co...

In settings where full incentive-compatibility is not available, such as core-constraint combinatorial auctions and budget-balanced combinatorial exchanges, we may wish to design mechanisms that are as incentive-compatible as possible. This paper offers a new characterization of approximate incentive-compatibility by casting the pricing problem as a meta-game between the center and the particip...

The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (single minded bidders). This paper extends the current art by proposing an optimal auction for procuring multiple units of multiple items when the bidders are single minded. The auction minimizes the cost of procurement while satisf...

We introduce several efficiency notions depending on what kind of expected utility is used (ex ante, interim, ex post) and on how agents share their private information, i.e., whether they redistribute their initial endowments based on their own private information, or common knowledge information, or pooled information. Moreover, we introduce several Bayesian incentive compatibility notions an...

We assess the strength of the different conditions identified in the literature of robust mechanism design. We focus on three conditions: ex post incentive compatibility, robust monotonicity, and robust measurability. Ex post incentive compatibility has been shown to be necessary for any concept of robust implementation, while robust monotonicity and robust measurability have been shown to be n...