We consider the problem of allocating a single object to the agents with payments. Agents have preferences that are not necessarily quasi-linear. We characterize the class of rules satisfying pairwise strategy-proofness and non-imposition by the priority rule. Our characterization result remains...

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 mechanism design. We explore information structures that dier with respect to what is commonly known about the weight that agents attach to reciprocal kindness. When the designer has no information on reciprocity types, implementability of an...

We analyse pricing, effort and tipping decisions in the online service "Google Answers". While users set a price for the answer to their question ex ante, they can additionally give a tip to the researcher ex post. In line with the related experimental literature we find evidence that tipping is...

In this paper, I study dynamic and sequential fair division problems for players with dichotomous preferences. I have devised a systematic approach of designing efficient, envy-free, and strategy-proof mechanisms for generic problems. The mechanisms developed in this paper can accommodate common...

We investigate how heterogeneous social preferences affect the communication of painful information in social relationships. We characterize the existence conditions for a pooling equilibrium in which individuals conceal painful information because revealing the latter would signal that they are...