We consider the problem of assigning objects probabilistically among a group of agents who may have multi-unit demands. Each agent has linear preferences over the (set of) objects. The most commonly used extension of preferences to compare probabilistic assignments is by means of stochastic dominance, which leads to corresponding notions of envy-freeness, efficiency, and strategy-proofness. We show that equal treatment of equals, efficiency, and strategy-proofness are incompatible. Moreover, anonymity, neutrality, efficiency, and weak strategy-proofness are incompatible. If we strengthen weak strategy-proofness to weak group strategy-proofness, then when agents have single-unit demands, anonymity, neutrality, efficiency, and weak group strategy-proofness become incompatible.
ASJC Scopus subject areas