A New Voting Model For Groups With Members of Unequal Power and Proficiency (original) (raw)

A method for discriminating efficient candidates with ranked voting data

European Journal of Operational Research, 2003

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.

A new approach for ranking of candidates in voting systems

OPSEARCH, 2012

This paper proposes a new approach to allow the voters to express their preferences on a set of candidates in ranked voting systems. This approach assumes that the votes of all voters have not equal importance and there is a priority among voters. Here, voters are classified into several groups in terms of their priorities that the vote of a higher category has a greater important than that of lower category. Then, the existing ranking methods are extended to discriminate efficient candidates in our proposed model. Moreover, a new criterion to obtain a total ranking by evaluating different ranking methods based on classical voting system is given. Finally the proposed method is illustrated with an application example and shows to be effective and practical.

A Method for Discriminating Efficient Candidates with Ranked Voting Data by Common Weights

2012

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.

A theory of measuring, electing, and ranking

Proceedings of The National Academy of Sciences, 2007

Le modèle traditionnel du choix social admet une multitude d'impossibilités et n'a abouti à aucune méthode incontestable pour élire un candidat ou ranger des compétiteurs. Un nouveau modèle permet de contourner les impossibilités avec une méthode éminemment pratique, "la valeur-majoritaire".

Three New Models for Ranking of Candidates In the Preferential Voting Systems

International Journal of Management Research and Social Science , 2021

Election is the main challenge to the political and social science. In the meantime, in the literature, several methods to decide the winner of elections have been proposed; theoretically there is no reason to be limited to these models. Hence, in this paper, we assume three new approaches (1. election result prediction by pre-election preference information using Markov chain model [to identify the efficient electoral strategy for each candidate]. 2. Improved Borda's function method using the weights of decision makers [or voters]. And 3. A new interval TOPSIS-based approach applying ordinal set of preferences [so, data is ordinal form that first convert to interval value and then inject them into the conventional interval TOPSIS model]) for ranking candidates in voting systems. Ultimately, three numerical examples in social choice context are given to depict the feasibility and practability of the proposed methods. In sum, this paper suggests a mind line for decreasing the wrong choice winner risks correlated with voting systems.

Ranking of candidates in the preferential voting framework based on a new approach

2012

In ranked voting systems, each voter selects a subset of candidates and ranks them from most to least preferred. The preference score obtained by each candidate is the weighted sum of votes receives in different places. The main drawback of this approach is that it assumes there is no preference among voters. In this paper we first attempt to analyze and show some drawbacks of this approach. Then, we propose a new method in which voters are classified into several categories based on their priorities that the vote of a higher category may have a greater importance than that of the lower category.

Ranking of petrochemical companies using preferential voting at unequal levels of voting power through data envelopment analysis

Mathematical Sciences

The initial issue that must be addressed in teamwork is the manner in which decisions are made by the group and its members. Voting is a procedure to aggregate individual votes to achieve a collective decision. Since individuals have varied opinions and preferences, preferential voting assists in conveying the priorities of the voters to the society or community. In many circumstances, such as voting-based managerial decisions, voters are of a voting preference of unequal voting power. This paper presents a method for the ranking of preferential voting with voters of unequal voting power, which, in addition to the utilization of preference voting models, employs the DEA and assurance region techniques. The deployment of DEA technique causes an increment in the competence of discriminating the ranking of candidates, and in the finale the proposed method is expressed for an empirical example to rank the petrochemical companies in the Tehran Stock Exchange.

Median and Average as Tools for Measuring, Electing and Ranking: New Prospects

Impossibility theorems expose inconsistencies and paradoxes related to voting systems. Recently, Michel Balinski and Rida Laraki proposed a new voting theory called Majority Judgment which tries to circumvent this limitation. In Majority Judgment, voters are invited to evaluate candidates in terms taken in a well-known common language. The winner is then the NGOIE, SAVADOGO and ULUNGU 10 one that obtains the highest median. Since the Majority Judgment proposal was made, authors have detected insufficiencies with this new voting system. This article aims at reducing these insufficiencies by proposing a voting system to decide between the median-based voting and the meanbased one. It proposes, moreover, a new tie-breaking method computing intermedian ranks mean.

A Decision-theoretic Model of Rank Aggregation

Abstract Modern social choice theory has spurred considerable recent work in computational rank aggregation, the problem of aggregating rankings into a consensus ranking. However, in the social choice context where rankings represent preferences of agents, or “voters,” over outcomes, or “candidates,” there is scant justification in the literature for producing rankings as an output of the aggregation process.