In many auctions, a good match between the bidder and seller raises the value of the contract for both parties although information about the quality of the match may be incomplete. This paper examines the case in which the bidder is better informed about the quality of his match with the seller...

In many auctions, matching between the bidder and seller raises the value of the contract for both parties. However, information about the quality of the match may be incomplete. We consider the case in which each bidder observes the quality of his match with the seller but the seller does not...

We study whether the mechanism design in the central bank liquidity auctions matters for the interbank money market interest rate levels and volatility. Furthermore, we compare different mechanisms to sell liquidity in terms of revenue, efficiency and auction stage interest rate levels and...

We study the bilateral trade problem put forward by Myerson and Satterthwaite (1983) under the assumption that agents are loss-averse. We use the model developed by Kőszegi and Rabin (2006, 2007) to find optimal mechanisms for the minimal subsidy, revenue maximization and welfare maximization...

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 introduce intention-based social preferences into a mechanism design framework with independent private values and quasilinear payoffs. For the case where the designer has no information about the intensity of social preferences, we provide conditions under which mechanisms which have been...

We introduce intention-based social preferences into a Bayesian mechanism design framework. We first show that, under common knowledge of social preferences, any tension between material efficiency, incentive compatibility, and voluntary participation can be resolved. Hence, famous impossibility...

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 robust virtual implementation, where robustness is the requirement that implementation succeed in all type spaces consistent with a given payoff type space as well as with a given space of first-order beliefs about the other agents\' payoff types. This last bit, which constitutes our...

Every agent reports his willingness to pay for one unit of good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an...