We analyze the performance of various communication protocols in a generalization of the Crawford-Sobel (1982) model of cheap talk that allows for multiple receivers. We find that whenever the sender can communicate informatively with both receivers by sending private messages, she can...

We consider the problem of fairly allocating one indivisible object when monetary transfers are possible, and examine the existence of Bayesian incentive compatible mechanisms to solve the problem. We propose a mechanism that satisfies envy-freeness, budget balancedness, and Bayesian incentive...

We analyze the performance of various communication protocols in a generalization of the Crawford-Sobel (1982) model of cheap talk that allows for multiple receivers. We find that whenever the sender can communicate informatively with both receivers by sending private messages, she can...

This paper solves for the set of equilibrium payoffs in bargaining with interdependent values when the informed party makes all offers, as discounting vanishes. The seller of a good is informed of its quality, which affects both his cost and the buyer's valuation, but the buyer is not. To...

This paper characterizes the set of equilibrium payoffs in bargaining with interdependent values when the informed party makes all offers, as discounting vanishes. The seller of a good is informed of its quality, which affects both his cost and the buyer's valuation, but the buyer is not. To...

Allocation and exchange of discrete resources such as kidneys, school seats, and many other resources for which agents have single-unit demand is conducted via direct mechanisms without monetary transfers. Incentive compatibility and efficiency are primary concerns in designing such mechanisms....

In a bargaining setting with asymmetrically informed, inequity-averse parties, a fully efficient mechanism (i.e., the double auction) exists if and only if compassion is strong. Less compassionate parties do not trade in the double auction in the limit of strong envy.

We solve for the optimal mechanism for selling two goods when the buyer’s demand characteristics are unobservable. In the case of substitutable goods, the seller has an incentive to offer lotteries over goods in order to charge the buyers with large differences in the valuations a higher price...

We extend the ‘no-haggling’ result of Riley and Zeckhauser (1983) to the class of linear multiproduct monopoly problems when the buyer’s valuations are smoothly distributed. In particular we show that there is no loss for the seller in optimizing over mechanisms such that all allocations...

Using a mechanism design framework, we characterize how a profit-maximizing intermediary can design matching markets when each agent is privately informed about his quality as a partner. Sufficient conditions are provided that ensure a version of positive assortative matching (what we call...