Thiele rules are polynomial-time computable on voter interval elections via a standard LP that always has an integral optimum, extending to VCI and LC domains with NP-hardness shown on tree-based generalizations.
Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems (
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Computing Thiele Rules on Interval Elections and their Generalizations
Thiele rules are polynomial-time computable on voter interval elections via a standard LP that always has an integral optimum, extending to VCI and LC domains with NP-hardness shown on tree-based generalizations.