atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Temporal Fairness in Multiwinner Voting

AAAI 2024 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

A position/survey paper that proposes a unified conceptual framework for temporal multiwinner voting (outcomes, preferences, observability, sequentiality, solution concepts) and organizes existing work and open research directions.

Problem

Existing work on multiwinner voting over multiple timesteps models repeated elections in very different ways, making results hard to compare and leaving fairness across time poorly systematized.

Approach

Proposes a unified multidimensional framework (outcome structure and constraints, ballot types, static vs dynamic preferences, online vs offline observability, sequentiality, and global/local/frequency-based solution concepts) that positions existing temporal voting models and identifies gaps.

Key results

Limitations

Experimental setup

Builds on: perpetual voting justified representation sequential committee elections fair scheduling

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy