For every ε>0 there exists an election in which every approximately dominating committee has size at least about 1/(32π ε^2), matching the known upper bound up to a constant factor.
Rolling the dice: Recent results in probabilistic social choice
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2026 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Pessimal Elections for Approximately Dominating Sets
For every ε>0 there exists an election in which every approximately dominating committee has size at least about 1/(32π ε^2), matching the known upper bound up to a constant factor.