We study the random assignment of indivisible objects among a set of agents with strict preferences. We show that there exists no mechanism which is unanimous, strategy-proof and envy-free. Weakening the first requirement to q-unanimity – i.e., when every agent ranks a different object at the...

Despite the truthful dominant strategy, participants in strategy-proof me- chanisms submit manipulated preferences. In our model, participants dislike rejections and enjoy the confirmation from getting what they declared most desirable. Formally, the payoff from a match decreases in its position...