资源分类
》 资源 》论文》A Social Welfare Optimal Sequential Allocation Procedure? Thomas Kalinowski Nina Narodytska and Toby Walsh

A Social Welfare Optimal Sequential Allocation Procedure? Thomas Kalinowski Nina Narodytska and Toby Walsh

2019-11-08 | |  79 |   51 |   0
Abstract 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.

上一篇：Defender (Mis)coordination in Security Games? Albert Xin Jiang Ariel D. Procaccia Yundi Qian

下一篇：An Intelligent Broker Agent for Energy Trading: An MDP Approach

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...