We derive several implications of incentive compatibility in general (i.e., not necessarily quasilinear) environments. Building on Kos and Messner (2013), we provide a (partial) characterization of incentive compatible mechanisms.

This paper describes a nearly optimal auction mechanism that does not require previous knowledge of the distribution of values of potential buyers. The mechanism we propose builds on the new literature on the elicitation of information from experts. We extend the latter to the case where the...

We show that the commitment to not allocate may be exploited by a seller/social planner to increase the expected social surplus that can be achieved in the sale of an indivisible unit.

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.

If the agent’s preference relation satisfies a strict monotonicity condition in common agency under the asymmetric information, the set of all equilibrium allocations in the menu game where menus of contracts are allowed coincides with the set of all equilibrium allocations in the single...

We consider a two-player all-pay auction with symmetric independent private values that are uniformly distributed. The designer chooses the size of a head start that is given to one of the players. The designer’s objective is to maximize a convex combination of the expected highest effort and...

We consider two-player, perfectly discriminatory, common-value contests (or all-pay auctions), in which one player knows the value of the contested object with certainty, and the other knows only its prior distribution. We show, among other things, that in equilibrium the players win with equal...

We prove that the maximal bid in asymmetric first-price and all-pay auctions is the same for all bidders. Our proof is elementary, and does not require that bidders are risk neutral, or that the distribution functions of their valuations are independent or smooth.

Consider a contest for a prize in which each player knows his/her own ability, but may or may not know those of his/her rivals (the complete or incomplete information regimes). Our main result is that, if the value of the prize is high, more effort and output are engendered under incomplete...

Implementability conditions in Rochet (1987) are extended to utility functions not necessarily quasilinear in the transfer, or linear in the type, for the case where agents’ information is one-dimensional but actions become multidimensional. The results obtained are relevant for the...