A Data Envelopment Model for Aggregating Preference Rankings

Abstract

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 = 1k Wjvij where vij is the number of the jth place votes received by the ith candidate. The weights Wj are assumed to form a monotonically decreasing sequence with Wj − Wj + 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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 345 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.