2 papers
cs.MA2026
The Communication Complexity of Instant-Runoff Voting
Élie de Panafieu, François Durand, Jérôme Lang
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 a…
cs.GT2026
Super Condorcet Winners and Limit Coalitional Manipulability of IRV
François Durand, Élie de Panafieu, Guillem Perarnau
We study the limit CM rate of single-winner voting rules under Impartial Culture, defined as the probability that a preference profile is coalitionally manipulable in the limit of…