Polynomial-Time Algorithm for Thiele Voting Rules with Voter Interval Preferences

ArXi:2604.05953v1 Announce Type: cross We present a polynomial-time algorithm for computing an optimal committee of size $k$ under any given Thiele voting rule for elections on the Voter Interval domain (i.e., when voters can be ordered so that each candidate is approved by a consecutive voters). Our result extends to the Generalized Thiele rule, in which each voter has an individual weight (scoring) sequence.