Algorithms for Structured Elections under Thiele Voting Rules
Making it faster to count votes when approval patterns follow a simple structure
Researchers found that a common voting method becomes much faster to compute when voters' approval choices follow a specific structure—where each candidate is approved by voters in a consecutive block. The team designed new algorithms that can solve what would otherwise be computationally intractable problems, and also cracked two long-standing open questions about how to quickly count votes under approval-based rules.
As organizations and governments adopt approval voting for committee selection, the ability to actually compute winners becomes essential. These algorithms make it practical to run Proportional Approval Voting on real-world elections where the approval patterns naturally cluster—a common scenario in actual voting data. This bridges the gap between voting theory and implementation by proving that structured real-world elections don't have the computational barriers that have limited these fairer voting systems' adoption.