IRV communication complexity is Theta(n (log m)^2) via fooling-set lower bound, matching the upper bound and reducing to Theta(n log m) on single-peaked domains.
Compil- ing the votes of a subelectorate
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.MA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Communication Complexity of Instant-Runoff Voting
IRV communication complexity is Theta(n (log m)^2) via fooling-set lower bound, matching the upper bound and reducing to Theta(n log m) on single-peaked domains.