ML Anthology

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

Neel Karia, Jérôme Lang
AAAI 2021 pp. 15809-15810
doi:10.1609/AAAI.V35I18.17901 /aaai/2021/karia2021aaai-compilation/

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.

PDF AAAI Semantic Scholar

Cite

Text

Karia and Lang. "Compilation Complexity of Multi-Winner Voting Rules (Student Abstract)." AAAI Conference on Artificial Intelligence, 2021. doi:10.1609/AAAI.V35I18.17901

Markdown

[Karia and Lang. "Compilation Complexity of Multi-Winner Voting Rules (Student Abstract)." AAAI Conference on Artificial Intelligence, 2021.](https://mlanthology.org/aaai/2021/karia2021aaai-compilation/) doi:10.1609/AAAI.V35I18.17901

BibTeX

@inproceedings{karia2021aaai-compilation,
  title     = {{Compilation Complexity of Multi-Winner Voting Rules (Student Abstract)}},
  author    = {Karia, Neel and Lang, Jérôme},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2021},
  pages     = {15809-15810},
  doi       = {10.1609/AAAI.V35I18.17901},
  url       = {https://mlanthology.org/aaai/2021/karia2021aaai-compilation/}
}