Abstract:

The research area of social choice theory has many applications in economy, political sciences, social sciences, and computer science. Recently, a new research area, called computational social choice, that combines social choice theory and computer science gained a significant influence. Voting theory represents an important topic in social choice theory and computational social choice. A very popular voting method is Borda Count. In this paper we propose a new voting method, called Weighted Q – Borda Count, which combines two variants of Borda Count from the literature: Q – Borda Count and Weighted Borda Count. Also, we perform a comparative analysis of the four voting methods mentioned above on a scenario and highlight the advantages of Weighted Q – Borda Count over the other three voting methods. We also propose and prove two properties of Weighted Q – Borda Count.