A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
In recent years, the Pirate Party of Sweden, the Wikimedia Foundation, the Debian project, the “Software in the Public Interest”
project, the Gentoo project, and many other private organizations adopted a new single-winner election method for internal
elections and referendums. In this article, we will introduce this method, demonstrate that it satisfies, e.g., resolvability,
Condorcet, Pareto, reversal symmetry, monotonicity, and independence of clones and present an O(C^3) algorithm to calculate the winner, where C is the number of alternatives.