Maximizing how many voter pairs a committee connects is NP-hard in general but polynomial-time solvable on left-right interval preferences, with tight approximation trade-offs against classic representation goals.
Electoral rules, strategic entry and polarization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Selecting Interlacing Committees
Maximizing how many voter pairs a committee connects is NP-hard in general but polynomial-time solvable on left-right interval preferences, with tight approximation trade-offs against classic representation goals.