A method for discriminating efficient candidates with ranked voting data by common weights (Q1649181)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A method for discriminating efficient candidates with ranked voting data by common weights |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A method for discriminating efficient candidates with ranked voting data by common weights |
scientific article |
Statements
A method for discriminating efficient candidates with ranked voting data by common weights (English)
0 references
5 July 2018
0 references
Summary: Ranked voting data arise when voters select and rank more than one candidate with an order of preference. \textit{W. D. Cook} and \textit{M. Kress} [Manage. Sci. 36, No. 11, 1302--1310 (1990; Zbl 0727.90005)] introduced data envelopment analysis (DEA) to analyze ranked voting data. \textit{T. Obata} and \textit{H. Ishii} [Eur. J. Oper. Res. 151, No. 1, 233--237 (2003; Zbl 1033.90054)] proposed a new method that did not use information obtained from inefficient candidates to discriminate efficient candidates. \textit{F.-H. F. Liu} and \textit{H. H. Peng} [Comput. Oper. Res. 35, No. 5, 1624--1637 (2008; Zbl 1211.90101)] ranked efficient DMUs on the DEA frontier with common weights. They proposed a methodology to determine one common set of weights for the performance indices of all DMUs. Then, these DMUs were ranked according to the efficiency score weighted by the common set of weights. In this paper, we use one common set of weights for ranked voting data.
0 references
data envelopment analysis (DEA)
0 references
ranked voting data
0 references
ranking of candidates
0 references
common weight
0 references