A descending-budget algorithm with gap-normalized voter offers computes Hare-FJR and Droop-FJR committees in polynomial time, resolving an open problem in approval-based multiwinner voting.
Proceedings of the 22nd
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Full Justified Representation under Hare and Droop Quotas in Polynomial Time
A descending-budget algorithm with gap-normalized voter offers computes Hare-FJR and Droop-FJR committees in polynomial time, resolving an open problem in approval-based multiwinner voting.