In the article 8 candidates sorting algorithms were compared by Monte Carlo experiments. 6 of them are constructed on the basis of voting theory and 2 – on the basis of Kemeny median. The largest number of correct decisions averages and the least average number of unfinished voting procedures were shown by the median-based sorting algorithms.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Please read the Copyright Notice in Journal Policy.