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
TypeCommunication / Conférence
Conference title35th AAAI Conference on Artificial Intelligence
Book title35th AAAI Conference on Artificial Intelligence
Palo Alto (USA)
MetadataShow full item record
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 / KeywordsSocial Choice; Voting Rules; Multiwinner; Compilation Complexity
Showing items related by title and author.