74%Highly rated
?Highly ratedVote to see the score
Polynomial-Time Algorithm for Thiele Voting Rules with Voter Interval Preferences
A polynomial-time algorithm computes optimal Thiele committees for voter-interval preferences via a concavity theorem and Lagrangian relaxation.
Sydney Poster Session 4, Wed, Dec 9, 5:00 PM–8:00 PM, Hall 1-4 · 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 1/5
medium 5/10
strict 3/5