Core committees exist and are polynomial-time computable for approval-based elections with up to five voters or five distinct approval sets.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC) , pages=
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
-
Core Existence in Approval-Based Committee Elections with up to Five Voter Types
Core committees exist and are polynomial-time computable for approval-based elections with up to five voters or five distinct approval sets.