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.
Strategic, sincere, and heuristic voting under four election rules: an experimental study
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
IRV has limit CM rate strictly below 1 for m≥4 under impartial culture, while Plurality with Runoff reaches 1; exact rate obtained via probability of a Super Condorcet Winner existing.
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.
-
Super Condorcet Winners and Limit Coalitional Manipulability of IRV
IRV has limit CM rate strictly below 1 for m≥4 under impartial culture, while Plurality with Runoff reaches 1; exact rate obtained via probability of a Super Condorcet Winner existing.