The Communication Complexity of Instant-Runoff Voting

by [unverified] · free · Last verified 2026-06-21T03:07:59.621Z

The communication complexity of a voting rule is the worst-case number of bits that n voters must transmit to a central authority under the most efficient elicitation protocol in an election with m candidates. We study the communication complexity of Instant-Runoff Voting (IRV). Conitzer and Sand...