arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.6578cs.MAcs.GT
收藏

一个并行的无启发分配不可分割物品的协议

A Parallel Elicitation-Free Protocol for Allocating Indivisible Goods

Wei Huang, Jian Lou, Zhonghua Wen

摘要:

我们研究的问题,分配一组不可分割的商品多个代理。最近的工作[Bouveret and Lang,2011]重点关注以顺序的方式分配商品,并研究了代理人根据功利主义或平等主义标准挑选物品的“最佳”序列是什么。在本文中,我们提出了一个并行的启发式自由分配不可分割的货物协议。在每一轮的分配过程中,一些代理将被选择(根据一些政策),以报告他们的首选对象之间的那些仍然存在,每个报告的对象将被随机分配给代理报告it.Empirical并行协议(应用一个简单的选择策略)和顺序协议(应用最优序列)之间的比较表明,我们提出的协议是有前途的。我们还讨论了战略问题。

英文摘要:

We study the problem of allocating a set of indivisible goods to multiple agents. Recent work [Bouveret and Lang, 2011] focused on allocating goods in a sequential way, and studied what is the "best" sequence of agents to pick objects based on utilitarian or egalitarian criterion. In this paper, we propose a parallel elicitation-free protocol for allocating indivisible goods. In every round of the allocation process, some agents will be selected (according to some policy) to report their preferred objects among those that remain, and every reported object will be allocated randomly to an agent reporting it. Empirical comparison between the parallel protocol (applying a simple selection policy) and the sequential protocol (applying the optimal sequence) reveals that our proposed protocol is promising. We also address strategical issues.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑