Compilation Complexity of Multi-Winner Voting Rules (Student Abstract)

Download PDF
Open Webpage

Neel Karia, Jérôme Lang

Published: 2021, Last Modified: 11 Apr 2025AAAI 2021EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Compiling the votes of a subelectorate consists of storing the votes of a subset of voters in a compressed form, such that the winners can still be determined when additional votes are included. This leads to the notion of compilation complexity, which has already been investigated for single-winner voting rules. We perform a compilation complexity analysis of several common multi-winner voting rules.