Multistage Committee Election

05/05/2020
by   Robert Bredereck, et al.
0

Electing a single committee of a small size is a classical and well-understood voting situation. Being interested in a sequence of committees, we introduce and study two time-dependent multistage models based on simple Plurality voting. Therein, we are given a sequence of voting profiles (stages) over the same set of agents and candidates, and our task is to find a small committee for each stage of high score. In the conservative model we additionally require that any two consecutive committees have a small symmetric difference. Analogously, in the revolutionary model we require large symmetric differences. We prove both models to be NP-hard even for a constant number of agents, and, based on this, initiate a parameterized complexity analysis for the most natural parameters and combinations thereof. Among other results, we prove both models to be in XP yet W[1]-hard regarding the number of stages, and that being revolutionary seems to be "easier" than being conservative: If the (upper- resp. lower-) bound on the size of symmetric differences is constant, the conservative model remains NP-hard while the revolutionary model becomes polynomial-time solvable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2014

Computational Aspects of Multi-Winner Approval Voting

We study computational aspects of three prominent voting rules that use ...
research
06/27/2011

Manipulation of Nanson's and Baldwin's Rules

Nanson's and Baldwin's voting rules select a winner by successively elim...
research
04/30/2023

The iteration time and the general position number in graph convexities

In this paper, we study two graph convexity parameters: iteration time a...
research
02/10/2020

On the Complexity of Constructive Control under Nearly Single-Peaked Preferences

We investigate the complexity of Constructive Control by Adding/Deleting...
research
08/30/2021

Justifying Groups in Multiwinner Approval Voting

Justified representation (JR) is a standard notion of representation in ...
research
04/22/2018

Spatial analysis of U.S. Supreme Court 5-to-4 decisions

While the U.S. Supreme Court is commonly viewed as comprising a liberal ...
research
12/23/2022

On the Complexity of Generalized Discrete Logarithm Problem

Generalized Discrete Logarithm Problem (GDLP) is an extension of the Dis...

Please sign up or login with your details

Forgot password? Click here to reset