Abstract:

Computational social choice represents a new research area that combines social choice theory and computer science, two areas with many applications to real world problems in the last decades. An important topic in computational social choice is voting theory. Recently, a new voting method, called Q – Borda Count, has been proposed; the voting scheme (i.e. the matrix of the ordered preferences of the voters over the set of candidates) associated to Q – Borda Count voting method is called Q – voting scheme. When the voters are software agents, the Q – voting schemes must be created automatically, i.e. using algorithms. In this paper we propose a new algorithm for creating Q – voting schemes and we show how this algorithm works on two examples. In addition, we compare our algorithm with an existing algorithm from the literature that solves the same problem and we provide several experimental results.