Abstract
We study a model of multiwinner voting where candidates are selected sequentially in rounds over a time horizon. Prior work has adapted popular notions of justified representation as well as voting rules that provide strong representation guarantees from the standard single-round multiwinner election case to the temporal setting. In our work, we focus on the complexity of verifying whether a given outcome is proportional. We show that the temporal setting is strictly harder than the standard single-round model of multiwinner voting, but identify natural special cases that enable efficient verification.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2246-2248 |
| Number of pages | 3 |
| Journal | Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS |
| Volume | 2024-May |
| State | Published - 2024 |
| Event | 23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024 - Auckland, New Zealand Duration: May 6 2024 → May 10 2024 |
Funding
This work was supported by the AI Programme of The Alan Turing Institute.
Keywords
- Computational Social Choice
- Proportionality
- Temporal Voting
ASJC Scopus subject areas
- Artificial Intelligence
- Software
- Control and Systems Engineering