{'fraction_non_alphanumeric': 0.025412960609911054, 'fraction_numerical': 0.0038119440914866584, 'mean_word_length': 4.751824817518248, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Method for Discriminating Efficient Candidates with Ranked Voting Data by Common Weights

Ranked voting data arise when voters select and rank more than one candidate with an order of preference. Cook et al.[1] introduced data envelopment analysis (DEA) to analyze ranked voting data. Obata et al.[2] proposed a new method that did not use information obtained from inefficient candidates to discriminate efficient candidates. Liu et al.[3] 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.