期刊
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS
卷 30, 期 2, 页码 259-290出版社
SPRINGER
DOI: 10.1007/s10458-015-9287-3
关键词
Computational social choice; Resource allocation; Fair division; Indivisible goods; Preferences
We investigate five different fairness criteria in a simple model of fair resource allocation of indivisible goods based on additive preferences. We show how these criteria are connected to each other, forming an ordered scale that can be used to characterize how conflicting the agents' preferences are: for a given instance of a resource allocation problem, the less conflicting the agents' preferences are, the more demanding criterion this instance is able to satisfy, and the more satisfactory the allocation can be. We analyze the computational properties of the five criteria, give some experimental results about them, and further investigate a slightly richer model with -additive preferences.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据