A Set Transformer learns participatory budgeting aggregation rules from labeled examples and can approximate compromise rules such as a 30-70 AV-CC blend close to PAV.
Ties in Multiwinner Approval Voting
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study the complexity of deciding whether there is a tie in a given approval-based multiwinner election, as well as the complexity of counting tied winning committees. We consider a family of Thiele rules, their greedy variants, Phragmen's sequential rule, and Method of Equal Shares. For most cases, our problems are computationally hard, but for sequential rules we find an FPT algorithm for discovering ties (parameterized by the committee size). We also show experimentally that in elections of moderate size ties are quite frequent.
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Learning Aggregation Rules in Participatory Budgeting: A Data-Driven Approach
A Set Transformer learns participatory budgeting aggregation rules from labeled examples and can approximate compromise rules such as a 30-70 AV-CC blend close to PAV.