The Schulze voting method aggregates voter preference data using maxmin-weight graph paths, achieving the Condorcet property that a candidate who would win every head-to-head contest will also win the overall election. Once the voter preferences among $m$ candidates have been arranged into an $m\times m$ matrix of pairwise election outcomes, a previous algorithm of Sornat, Vassilevska Williams and Xu (EC '21) determines the Schulze winner in randomized expected time $O(m^2\log^4 m)$. We improve this to randomized expected time $O(m^2\log m)$ using a modified version of quickselect.

翻译：舒尔茨投票方法通过最大最小权重图路径聚合选民偏好数据，实现了孔多塞性质：即在所有一对一竞争中均能获胜的候选人也将赢得整体选举。当$m$位候选人之间的选民偏好被整理为$m\times m$的成对选举结果矩阵后，Sornat、Vassilevska Williams和Xu（EC '21）提出的算法能以随机期望时间$O(m^2\log^4 m)$确定舒尔茨胜选者。我们通过改进的快速选择算法将这一时间提升至随机期望时间$O(m^2\log m)$。