Polynomial-time algorithm for optimal Thiele committees on voter interval profiles via a new concavity theorem and totally unimodular Lagrangian relaxation.
Our original maximization objective isF(k) =−C(k)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial-Time Algorithm for Thiele Voting Rules with Voter Interval Preferences
Polynomial-time algorithm for optimal Thiele committees on voter interval profiles via a new concavity theorem and totally unimodular Lagrangian relaxation.