74%Highly rated
?Highly ratedVote to see the score
Computing Thiele Rules on Interval Elections and their Generalizations
Thiele rules are polynomial-time computable on voter-interval and linearly consistent domains via integral linear programming, and linearly consistent domains strictly contain voter-candidate interval domains, though tree-based extensions are NP-hard.
Paris Poster Session 4, Thu, Dec 10, 5:30 PM–7:30 PM, Paris Poster Hall · Published 2026
– ReadersNo votes yet
9/20 AI panelreviewers recommend it
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
AI panel: 9 of 20 reviewers recommend it
lenient 0/5
medium 6/10
strict 3/5