Thumbnail

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

Karia, Neel; Lang, Jérôme (2021), Compilation Complexity of Multi-Winner Voting Rules (Student Abstract), 35th AAAI Conference on Artificial Intelligence, AAAI Press : Palo Alto (USA), p. 15809-15810

View/Open
Type
Communication / Conférence
Date
2021
Conference title
35th AAAI Conference on Artificial Intelligence
Conference date
2021-02
Book title
35th AAAI Conference on Artificial Intelligence
Publisher
AAAI Press
Published in
Palo Alto (USA)
ISBN
978-1-57735-866-4
Pages
15809-15810
Metadata
Show full item record
Author(s)
Karia, Neel
Lang, Jérôme
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
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.
Subjects / Keywords
Social Choice; Voting Rules; Multiwinner; Compilation Complexity