Ranking objects from a preference relation over their subsets
Ranking objects from a preference relation over their subsets
复制标题
DOI：
10.1007/s00355-018-1161-1
复制
发表时间：
2019-04-01
影响因子：
0.9
通讯作者：
Moretti, Stefano
中科院分区：
文献类型：
--
作者：
Bernardi, Giulia;Lucchetti, Roberto;Moretti, Stefano
在许多日常情况下，我们需要对个人或单个项目进行排名，以便观察群体的行为。在本文中，我们提出了一种对集合 X 的元素进行排序的方法，从对 X 的子集的任意偏好关系开始，并考虑对子集的排序所提供的信息。为此，我们在社会选择框架中使用了一种非常常见的方法：我们挑选出通用解决方案应满足的一些属性，并证明这些属性表征了唯一的解决方案。鉴于该方法的普遍性，我们认为本文只是更广泛分析的起点。特别是，很明显，不同的上下文可以暗示其他属性，从而确定替代的排名方法。
In many everyday situations, we need to rank individuals or single items having the possibility to observe the behavior of groups. In this paper we propose a way to get this ranking over the elements of a set X, starting from an arbitrary preference relation over the subsets of X and taking into account the information provided by this ranking over the subsets. To this purpose, we use a very common approach in the social choice framework: we single out some properties that a general solution should satisfy, and we prove that these properties characterize a unique solution. Given the generality of the approach, we believe that this paper is only a starting point for a more extended analysis. In particular, it is clear that different contexts can suggest other properties, thus identifying alternative ranking methods.