Multiwinner Temporal Voting with Aversion to Change

Valentin Zech, Niclas Boehmer, Edith Elkind, Nicholas Teh
8/20/2024
cs.GTcs.AIcs.CC

No official code found. Best implementation: ValentinZech/ECAI_Multiwinner_Temporal_Voting_with_Aversion_to_Change (0 stars, last commit 2024-11-14).

Abstract

We study two-stage committee elections where voters have dynamic preferences over candidates; at each stage, a committee is chosen under a given voting rule. We are interested in identifying a winning committee for the second stage that overlaps as much as possible with the first-stage committee. We show a full complexity dichotomy for the class of Thiele rules: this problem is tractable for Approval Voting (AV) and hard for all other Thiele rules (including, in particular, Proportional Approval Voting and the Chamberlin-Courant rule). We extend this dichotomy to the greedy variants of Thiele rules. We also explore this problem from a parameterized complexity perspective for several natural parameters. We complement the theory with experimental analysis: e.g., we investigate the average number of changes in the committee as a function of changes in voters' preferences and the role of ties.

View on arXivView PDF

Code Implementations(1)

00Cython, PythonJul 15, 20241 years ago

Cite this paper

@article{zech2024multiwinner,
  title  = {Multiwinner Temporal Voting with Aversion to Change},
  author = {Valentin Zech and Niclas Boehmer and Edith Elkind and Nicholas Teh},
  year   = {2024},
  eprint = {2408.11017},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.11017v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.11017.svg)](https://codeofpaper.com/paper/2408.11017)

Discussion