A Bayesian incentive compatible mechanism for fair division

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 compatibility. Further, we establish the uniqueness of the mechanism under an order additivity condition. This result contrasts well with various results on the incompatibility between efficiency and ex post incentive compatibility.