Cost-Free Neutrality for the River Method

TL;DR

This work addresses computing River method outcomes under Parallel-Universe Tiebreaking (PUT), a problem previously NP-hard for related rules. The authors introduce the Fused-Universe (FUN) diagram, leveraging River’s single-incoming-edge property to simulate all tiebreakers in one pass. They prove that FUN exactly characterizes RV-PUT winners and provide a certificate-based backward direction to realize River diagrams for specific universes. Empirical results show FUN enables scalable, efficient computation of PUT River outcomes and competitive performance relative to other margin-based rules, underscoring River’s practical viability for neutrality-preserving voting in complex preference settings.

Abstract

Recently, the River Method was introduced as novel refinement of the Split Cycle voting rule. The decision-making process of River is closely related to the well established Ranked Pairs Method. Both methods consider a margin graph computed from the voters' preferences and eliminate majority cycles in that graph to choose a winner. As ties can occur in the margin graph, a tiebreaker is required along with the preferences. While such a tiebreaker makes the computation efficient, it compromises the fundamental property of neutrality: the voting rule should not favor alternatives in advance. One way to reintroduce neutrality is to use Parallel-Universe Tiebreaking (PUT), where each alternative is a winner if it wins according to any possible tiebreaker. Unfortunately, computing the winners selected by Ranked Pairs with PUT is NP-complete. Given the similarity of River to Ranked Pairs, one might expect River to suffer from the same complexity. Surprisingly, we show the opposite: We present a polynomial-time algorithm for computing River winners with PUT, highlighting significant structural advantages of River over Ranked Pairs. Our Fused-Universe (FUN) algorithm simulates River for every possible tiebreaking in one pass. From the resulting FUN diagram one can then directly read off both the set of winners and, for each winner, a certificate that explains how this alternative dominates the others.

Figures (4)

• Figure 1: Election with margin graph $\mathcal{M}\xspace$, $\mathsf{FUN}$ diagram ${\mathcal{M}\xspace^{\mathsf{FUN}\xspace}}$ with edge/vertex states and $\operatorname{\mathsf{RV\hbox{-}PUT}}$ winner $x$.
• Figure 2: Exemplary illustration for the proof of \ref{['lem:certtree-has-path']}. Dotted arrows represent paths, and the shaded region indicates the current tree $T$. All solid arrows are edges in the Fused-Universe diagram ${\mathcal{M}\xspace^{\mathsf{FUN}\xspace}}\xspace$. From left to right: (i) before DirectedMaxPrim picks $(d,s)$ from the current set of crossing edges, with $d^L \notin T$; (ii) after $(d,s)$ is added to $T$ and a path $P_{sd^L}\xspace$ exists in ${\mathcal{M}\xspace^{\mathsf{FUN}\xspace}}\xspace$; (iii) when DirectedMaxPrim explores $d^L$ via a path from $s$.
• Figure 3: A scatterplot of all recorded running times of the $\mathsf{FUN}$ algorithm versus $\operatorname{\mathsf{RV\hbox{-}PUT}}$ and $\operatorname{\mathsf{RP\hbox{-}PUT}}$ as implemented in pref-voting by mattei_preflib_2013 over synthetic election with different numbers of alternatives and voters on a logarithmic scale. Note that after 3 timeouts, no more running times where recorded for that $m$.
• Figure 4: Average running time of the $\mathsf{FUN}$ algorithm versus Stable Voting, Beat Path, and Split Cycle as implemented in pref-voting by mattei_preflib_2013 over single runs per 20 synthetic elections with different numbers of alternatives and voters on a logarithmic scale.

Theorems & Definitions (19)

• Theorem 3.1
• proof
• Theorem 4.1
• Lemma 4.2
• proof
• Claim 4.3
• proof
• Theorem 4.4: Forward Direction of Main Theorem
• proof
• proof