.png){kind=icon}
返回
Measuring unfairness feeling in allocation problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2016.01.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we introduce a new measure of social fairness based on unfairness feelings of the players involved in an allocation problem, e.g., cake-cutting problem or shift scheduling. We only require that each player be described by a von Neumann-Morgenstern utility function. Next, we propose a social normalization of each player's utility function, based on how each player sees the other players' shares through her own utility function. Further, we extend this normalization idea to a setting where the players are represented by a weighted oriented graph, where the weights assess the relatedness of (or similarities between) the agents. Among other results, we establish some links between our measures of fairness and those classically used in the cake-cutting-problem literature. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Fairness
Social normalization
Utility
Allocation problem
Social network
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
分享收藏
查看更多内容