ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2505.12976
63
9
v1v2 (latest)

Computing the Schulze Method for Large-Scale Preference Data Sets

19 May 2025
Theresa Csar
Martin Lackner
Reinhard Pichler
ArXiv (abs)PDFHTML
Main:14 Pages
2 Figures
Bibliography:2 Pages
1 Tables
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.

View on arXiv
@article{csar2025_2505.12976,
  title={ Computing the Schulze Method for Large-Scale Preference Data Sets },
  author={ Theresa Csar and Martin Lackner and Reinhard Pichler },
  journal={arXiv preprint arXiv:2505.12976},
  year={ 2025 }
}
Comments on this paper