A Social Welfare Optimal Sequential Allocation Procedure

04/22/2013

∙

by   Thomas Kalinowski, et al.

∙

0

∙

share

We consider a simple sequential allocation procedure for sharing indivisible items between agents in which agents take turns to pick items. Supposing additive utilities and independence between the agents, we show that the expected utility of each agent is computable in polynomial time. Using this result, we prove that the expected utilitarian social welfare is maximized when agents take alternate turns. We also argue that this mechanism remains optimal when agents behave strategically