Verifying Proportionality in Temporal Voting

Edith Elkind, Svetlana Obraztsova, Jannik Peters, Nicholas Teh
2/9/2025
cs.GTcs.AI

No confident code implementation found for this paper.

Abstract

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of justified representation as well as voting rules that provide strong representation guarantees from the multiwinner election setting to this model. In our work, we focus on the complexity of verifying whether a given outcome offers proportional representation. We show that in the temporal setting verification is strictly harder than in multiwinner voting, but identify natural special cases that enable efficient algorithms.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{elkind2025verifying,
  title  = {Verifying Proportionality in Temporal Voting},
  author = {Edith Elkind and Svetlana Obraztsova and Jannik Peters and Nicholas Teh},
  year   = {2025},
  eprint = {2502.05949},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.05949v1}
}

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/2502.05949.svg)](https://codeofpaper.com/paper/2502.05949)

Discussion