Aggregation of ranked votes considering different relative gaps between rank positions
研究了基于数据包络分析的排名投票问题，利用约束的极值点求解，适用于考虑排名位置间不同相对差距的投票模型。
This paper considers ranked voting systems to determine the rank order of candidates who compete for a limited number of positions. We show that the preferential voting problems based on the data envelopment analysis (DEA) (Wang et al, ) can be solved using the extreme points of constraints on rank position importance incorporated in the formulation. This is basically due to the fact that the so-called inverse positive property of the constraints makes it possible to easily find their extreme points. Further, we emphasize that this finding is not restricted to Wang et al’s two linear models, but is also applicable to other DEA-based preferential voting problems, which include the constraints accounting for different relative gaps between rank positions.