Skip to content
conftrace_
2021 AAAI AAAI 2021

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

Abstract

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.

Authors

Neel Karia, Jérôme Lang

Topics

Artificial Intelligence > Core AI > Multi-Agent Systems

Keywords

multiwinner voting voting rule winner determination compressed representation electoral system compilation complexity vote compression
Download PDF

More from AAAI 2021

All AAAI 2021 papers →
HetSAGE: Heterogenous Graph Neural Network for Relational Learning (Student Abstract)
Rotation-Invariant Gait Identification with Quaternion Convolutional Neural Networks (Student Abstract)
Gradient-Based Localization and Spatial Attention for Confidence Measure in Fine-Grained Recognition using Deep Neural Networks
A Deep Learning Framework for Improving Lameness Identification in Dairy Cattle
An Unfair Affinity Toward Fairness: Characterizing 70 Years of Social Biases in BHollywood (Student Abstract)
Leveraging on Deep Reinforcement Learning for Autonomous Safe Decision-Making in Highway On-ramp Merging (Student Abstract)