In Candidate Interval and Voter Interval domains, Pareto optimal committees admit a simple dominance characterization, satisfy monotonicity, allow direct reconfiguration, and support polynomial algorithms for proportionality and counting.
Single-peakedness and total unimodularity: New polynomial-time algorithms for multi-winner elections
1 Pith paper cite this work, alongside 22 external citations. Polarity classification is still indexing.
1
Pith paper citing it
22
external citations · OpenAlex
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Pareto Optimality in Approval-Based Multiwinner Voting
In Candidate Interval and Voter Interval domains, Pareto optimal committees admit a simple dominance characterization, satisfy monotonicity, allow direct reconfiguration, and support polynomial algorithms for proportionality and counting.