This paper considers the problem of allocating N indivisible objects among N agents according to their preferences when transfers are not allowed, and studies the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof...

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 consider a sequential game in which one player produces a public good and the other player can influence this decision by making an unconditional transfer. An efficient allocation requires the Lindahl property: the sum of the two (implicit) individual prices has to be equal to the resource...