Comparing social preferences: incompleteness and intransitivity
研究了一种将偏好映射到偏好上的超偏好规则，在去除传递性和完备性约束后，刻画了中性可分离超偏好规则的特征，并公理化了一族LG度量。
Abstract A hyperpreference rule is a rule which maps any preference (input) on the set of alternatives, to a preference over preferences (output). Such a rule is termed separable if it is obtained by weighting each type of disagreement on each pair of alternatives. Given two preferences, the most preferred is the one that minimizes the sum of weights obtained from the disagreements between preferences and the input. A hyperpreference rule is neutral when relabeling alternatives has no impact on the rule. Deprived of all constraints of transitivity and completeness on the preferences on the set of alternatives, I show that a neutral separable hyperpreference rule is characterized by a unique parametric semi-metric called LG metric. I provide an axiomatization of the family of LG metrics, which is essentially a generalization of the Kemeny metric over the whole set of reflexive binary relations.