Cost-Free Neutrality for the River Method

2025-12-16

AI Summary

Traditional tiebreaking mechanisms in voting rules violate neutrality, while Parallel-Universe Tiebreaking (PUT) restores neutrality but renders Ranked Pairs + PUT NP-complete. Although River shares structural similarities with Ranked Pairs, its computational complexity under PUT remained unresolved. Method: We introduce the Fused-Universe (FUN) algorithm, which models the problem via a margin graph and unifies exhaustive tie enumeration with cycle elimination into a single dynamic computation pass. Contribution/Results: We establish, for the first time, that River under PUT is solvable in polynomial time. FUN computes the neutral winner set and produces a verifiable dominance certificate in O(n⁴) time. By integrating full tie resolution and acyclicity enforcement cohesively, FUN achieves both strict neutrality and efficient decidability—resolving a longstanding open question and enabling practical deployment of neutral, strategyproof voting.

Technology Category

• Game Theory and Economic Paradigms: Social Choice / Voting
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking
• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• User Modeling, Personalization and Recommendation: Fairness-aware retrieval and ranking

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.

Problem

• Computing winners for River Method with neutrality is complex
• Neutrality requires Parallel-Universe Tiebreaking which is NP-complete
• Developing efficient algorithm for River with PUT is needed

Innovation

• Polynomial-time algorithm for River with PUT
• Fused-Universe simulation of all tiebreakings
• Direct winner extraction from FUN diagram