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 propose a solution to the trade-off between Pareto efficiency and stability in matching markets. We define a matching to be essentially stable if any claim initiates a chain of reassignments that ultimately results in the initial claimant losing the object she claimed to a third agent. Our...

This paper studies the incentive compatibility of solutions to generalized indivisible good allocation problems introduced by S¨onmez (1999), which contain the well-known marriage problems (Gale and Shapley, 1962) and the housing markets (Shapley and Scarf, 1974) as special cases. In...

This paper studies the incentive compatibility of solutions to generalized indivisible good allocation problems introduced by Sonmez (1999), which contain the well-known marriage problems (Gale and Shapley, 1962) and the housing markets (Shapley and Scarf, 1974) as special cases. In particular,...

Recent work highlights that cooperation in the one-shot Prisoner's dilemma (PD) is primarily driven by moral preferences for doing the right thing, rather than social preferences for equity or efficiency. By contrast, little is known on what motivates cooperation in the Stag-Hunt Game (SHG)....

We study the slot allocation problem where agents have quasi-linear single-peaked preferences over slots and identify the rules satisfying efficiency, strategy-proofness, and individual rationality. Since the quasi-linear single-peaked domain is not connected, the famous characterization of the...

Departures from "economic man" behavior in many games in which fairness is a salient characteristic are now well documented in the experimental economics literature. These data have inspired development of models of social preferences that assume agents have preferences for equity and efficiency...

We show that there is no consistent Pareto improvement over any stable mechanism. To overcome this impossibility, we introduce the following weak consistency requirement: Whenever a set of students, each of whom is assigned to a school that is under-demanded at the student-optimal stable...

I prove that there exists no assignment mechanism that is strategy-proof, non-wasteful and satisfies equal treatment of equals. This strengthens the impossibility result of Bogomolnaia and Moulin (2001) by weakening their assumption of ordinal efficiency to non-wastefulness. My result solves an...