A Data Envelopment Model for Aggregating Preference Rankings
提出一个通用模型来聚合偏好投票，通过数据包络分析中的保证域约束，为每位候选人赋予递减权重，从而公平评估其整体排名。
This paper presents a general model for aggregating votes from a preferential ballot. The thrust of the model is to accord each candidate a fair assessment in terms of his overall standing vis-a-vis first place, second place, …, kth place votes. The form of the model is a combined index Σ j = 1 k W j v ij where v ij is the number of the jth place votes received by the ith candidate. The weights W j are assumed to form a monotonically decreasing sequence with W j − W j + 1 ≥ d(j, ε). These constraints correspond to the assurance region (AR) side constraints in the DEA framework. The properties of the model are examined in terms of this discrimination intensity function d, and in the special case that d(j, ε) = ε, our model is shown to be equivalent to the consensus models of Borda and Kendall.