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

Authors

  • Neel Karia Department of Computer Science and Engineering, IIT Kharagpur
  • Jérôme Lang CNRS LAMSADE PSL Université Paris-Dauphine

DOI:

https://doi.org/10.1609/aaai.v35i18.17901

Keywords:

Social Choice, Voting Rules, Multiwinner, Compilation Complexity

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.
AAAI-21 Proceedings Cover

Downloads

Published

2021-05-18

How to Cite

Karia, N., & Lang, J. (2021). Compilation Complexity of Multi-Winner Voting Rules (Student Abstract). Proceedings of the AAAI Conference on Artificial Intelligence, 35(18), 15809-15810. https://doi.org/10.1609/aaai.v35i18.17901

Issue

Vol. 35 No. 18: AAAI-21 Student Papers and Demonstrations

Section

AAAI Student Abstract and Poster Program