🤖 AI Summary
To address the poor computational efficiency and scalability of the Schulze method on large-scale preference data, this paper proposes a high-performance parallel algorithm built upon the Pregel graph-processing framework. We first prove that Schulze winner determination is NL-complete—strictly below P-complete—thereby establishing its intrinsic parallel tractability and providing a theoretical foundation for efficient distributed implementation. Leveraging a weighted directed graph model over candidates, we design a novel parallel shortest-path optimization strategy, which significantly outperforms P-complete alternatives such as Ranked Pairs. Experimental evaluation demonstrates strong scalability to datasets with up to one million voters and candidates, achieving near-linear speedup on real-world data. The approach thus bridges deep theoretical insight—rooted in complexity-theoretic analysis—with practical engineering utility.
📝 Abstract
The Schulze method is a voting rule widely used in practice and enjoys many positive axiomatic properties. While it is computable in polynomial time, its straight-forward implementation does not scale well for large elections.
In this paper, we develop a highly optimised algorithm for computing the Schulze method with Pregel, a framework for massively parallel computation of graph problems, and demonstrate its applicability for large preference data sets. In addition, our theoretic analysis shows that the Schulze method is indeed particularly well-suited for parallel computation, in stark contrast to the related ranked pairs method. More precisely we show that winner determination subject to the Schulze method is NL-complete, whereas this problem is P-complete for the ranked pairs method.